Message transmission method and device

ABSTRACT

A message transmission method and device relating to the field of communications technologies are described that improve an anti-interference capability in message transmission. The method includes generating a scrambling code according to a scrambling code initialization seed, wherein the scrambling code initialization seed meets the following expression: cinit=R·2a7+P·(nf mod k+1)·2b7 and then scrambling a message according to the scrambling code. The method further includes sending the scrambled message to a terminal on a physical downlink shared channel. Because the first time parameter has different values at at least two different moments, scrambling codes determined at the at least two corresponding different moments are different. Therefore, a possibility at which the base station uses a same scrambling code to scramble a same system message repeatedly in a time period is reduced, so that an anti-interference capability in system message transmission is improved.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 16/507,866, filed on Jul. 10, 2019, which is a continuation of International Application No. PCT/CN2017/079375, filed on Apr. 1, 2017, which claims priority to International Application No. PCT/CN2017/070927, filed on Jan. 11, 2017, and International Application No. PCT/CN2017/073680, filed on Feb. 15, 2017. All of the aforementioned patent applications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

This application relates to the field of communications technologies, and in particular, to a message transmission method and device.

BACKGROUND

Currently, usually, a base station performs encoding and scrambling processing on a relatively important system message such as a MIB (master information block), then transmits the system message on a PBCH (physical broadcast channel), and transmits the system message in a broadcast manner.

For an anti-interference purpose, different scrambling codes need to be used for different cells, different terminals in a cell, or the like. A scrambling code is determined by the base station according to a scrambling code initialization seed, and the scrambling code initialization seed is determined according to a cell identity. A MIB is used as an example. A scrambling code initialization seed c_(init) is determined according to a cell identity N_(ID) ^(cell); and specifically, c_(init)=N_(ID) ^(cell). Although generated scrambling codes are different because of different cell identities of base stations, the MIB is repeatedly transmitted within 80 ms in the prior art (for example, in an NB-IoT (narrowband internet of things)) to increase a success rate of receiving the MIB by a terminal. Specifically, the MIB is sent eight times within 80 ms, and is sent once every 10 ms. From a scrambling code seed generation formula c_(init)=N_(ID) ^(cell), it can be learned that the MIB is transmitted within the 80 ms by using a same scrambling code. Because scrambling mechanisms of the base stations are the same, it is possible that within a same 80 ms time period, a base station 1 scrambles its MIB by using a scrambling code 1, and then broadcasts the MIB; and a base station 2 scrambles its MIB by using a scrambling code 2, and then broadcasts the MIB. There is considerable interference between the scrambled MIB sent by the base station 1 and the scrambled MIB sent by the base station 2, and a difference between the scrambled MIB of the base station 1 and the scrambled MIB of the base station 2 in each repetition is the same as that in a next repetition. Therefore, within 80 ms, when receiving the scrambled MIB of the base station 1 every 10 ms, and then performing descrambling and in-phase combination on each repetition of the scrambled MIB of the base station 1, a terminal of the base station 1 also performs in-phase combination on the scrambled MIB (which may be considered as interference) of the base station 2. Consequently, interference power increases, affecting performance of MIB reception by the terminal. The base station 1 and the base station 2 are used as an example in the foregoing description. A same problem also exists between different cells of a same base station.

In addition, an NB-IoT system is used as an example. A base station transmits a SIB (system information block) 1 on a physical downlink shared channel. Usually, the base station needs to perform encoding and scrambling processing on the SIB 1 before sending the SIB 1. However, in the prior art, when scrambling a SIB 1, a base station first generates a scrambling code initialization seed c_(init), and then generates a scrambling code according to the scrambling code initialization seed c_(init). Specifically, for the SIB 1, the scrambling code initialization seed is c_(init)=n_(RNTI)·2¹⁴+(n_(f) mod 2)·2¹³+└n_(s)/2┘·2⁹+N_(ID) ^(cell), where N_(ID) ^(cell) is a cell identity, and the cell identity does not change during transmission of the SIB1; n_(f) is a radio frame number; although the radio frame number varies with time, (n_(f) mod 2) remains unchanged because radio frames that carry the SIB1 are separated by an even quantity of radio frame numbers; n_(RNTI) is an SI-RNTI (system information radio network temporary identifier), and is a constant value; and n_(s) is a timeslot number, and the timeslot number is also fixed because the SIB 1 is always sent in a fixed subframe. Therefore, similar to the MIB, when base stations scramble the SIB 1 by using a same scrambling mechanism, interference during transmission of the SIB 1 increases, affecting performance of SIB 1 reception by a terminal.

SUMMARY

Embodiments of this application provide a message transmission method and device, so as to improve an anti-interference capability in message transmission.

According to a first aspect, a message sending method is provided, including: generating, by a base station, a scrambling code according to a first time parameter; then scrambling a system message according to the scrambling code; and finally sending the scrambled system message to a terminal on a physical broadcast channel.

It should be noted that the first time parameter has different values at at least two different moments in this embodiment of this application.

Because the first time parameter has different values at the at least two different moments, scrambling codes determined at the at least two corresponding different moments are different. Therefore, a possibility at which the base station uses a same scrambling code to scramble a same system message repeatedly in a time period is reduced, so that an anti-interference capability in system message transmission is improved.

Based on the first aspect, in a possible implementation, the first time parameter is a function of at least one of a radio frame number, a timeslot number, a hyper frame number, or a symbol number.

For example, the first time parameter is a function of the radio frame number. The radio frame number is a radio frame number in which a start position for sending the system message is located. Cases of the timeslot number, the hyper frame number, and the symbol number are similar to this.

Because the radio frame number, the timeslot number, the hyper frame number, or the symbol number of the system message varies with time, and the first time parameter is a function of at least one of the radio frame number, the timeslot number, the hyper frame number, or the symbol number, the first time parameter is also a physical quantity that varies with time. Therefore, the scrambling code determined according to the first time parameter also varies with time.

Based on the first aspect, in a possible implementation, the first time parameter is any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number; or the first time parameter is a value resulting from any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number modulo a first modulus, where the first modulus is a positive integer.

A benefit of doing so is that complexity of system message detection by the terminal is reduced. Because the terminal does not know all information about the radio frame number when detecting the scrambled system message, the terminal needs to perform blind detection.

For example, when the system message is a MIB, in an NB-IoT, the terminal may know, by using a synchronization message, a value resulting from the radio frame number modulo 8, and a minimum repetition period of the MIB is eight radio frames. Therefore, when the first modulus is 8, the terminal may be prevented from performing more blind detection operations on the radio frame number, and good anti-interference gains can be achieved. Therefore, in the NB-IoT, the first modulus may be set to 8 when the system message is a MIB.

Based on the first aspect, in a possible implementation, the first modulus is 2^(n), where n is a positive integer that is not equal to 3; or the first modulus is 8; or the first modulus is a prime number.

When the first modulus is a prime number, a better anti-interference capability in sending of the system message can be achieved by using a feature of the prime number.

Based on the first aspect, a possible implementation in which the base station generates the scrambling code according to the first time parameter is: The base station generates a scrambling code initialization seed according to the first time parameter and a first variable group, where the first variable group includes at least one of a cell identity, an RNTI, or a carrier identifier; and then generates the scrambling code according to the scrambling code initialization seed.

Based on the first aspect, another possible implementation in which the base station generates the scrambling code according to the first time parameter is: the base station generates a scrambling code initialization seed according to the first time parameter, and then generates the scrambling code according to the scrambling code initialization seed.

Based on the first aspect, an embodiment of this application further provides several possible implementations in which the base station generates the scrambling code initialization seed according to the first time parameter.

The first time parameter is the radio frame number n_(f), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f) mod k, where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; or the first time parameter is the radio frame number n_(f), the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f)·2^(a) ¹ )+N_(ID) ^(cell), or c_(init)=(N_(ID) ^(cell)·2^(b) ¹ )+n_(f), where a₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init), and b₁ is a quantity of bits occupied by n_(f) in c_(init); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(a) ² +N_(ID) ^(Cell), or c_(init)=N_(ID) ^(Cell)·2^(b) ² +(n_(f) mod k) where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; a₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); and b₂ is a quantity of bits occupied by (n_(f) mod k) in c_(init); or the first time parameter is a value resulting from the radio frame number n_(f) (or the radio frame number plus an integer) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=[(n_(f)+h)mod k)+w]^(u)·P·2^(d) ³ +Q, or c_(init)=[(n_(f)+h)mod k)+w]^(u)·P+Q·2^(b) ³ , where h is an integer, for example, h is equal to 0 or 1; k=8 k is a prime number, or k is a positive integer that is not 8 or a prime number; w is an integer, for example, w is equal to 0 or 1; u is a non-negative integer, for example, u may be 0, 1, 2, or 3; P is a function of the cell identity and/or the radio frame number, for example, P is equal to the cell identity N_(ID) ^(cell), or P is equal to N_(ID) ^(cell)+1, or P is equal to N_(ID) ^(cell)·(n_(f) mod k)^(v), where v is a positive integer; Q is a function of the cell identity, for example, is equal to the cell identity, or is equal to 0 (meaning that there is no parameter Q in the formula); a₃ is a non-negative integer, for example, a₃ is equal to a quantity of bits occupied by Q in c_(init); and b₃ is a non-negative integer, for example, b₃ is equal to a quantity of bits occupied by [(n_(f)+h)mod k)+w]^(u)·P in c_(init).

Based on the first aspect, in a possible implementation, the scrambling may be bit-level scrambling. For example, modulo-2 addition may be performed on the scrambling code and to-be-scrambled information. The to-be-scrambled information may be a system message or a part of a system message, or may be an encoded system message or a part of an encoded system message.

Based on the first aspect, in another possible implementation, the scrambling may be symbol-level scrambling. For example, the base station may first map the scrambling code from a bit form to a symbol form. A mapping method is not limited. For example, BPSK or QPSK modulation or another similar mapping method may be performed. Then, the base station performs a pointwise multiplication operation, a pointwise conjugate multiplication operation, or the like on the scrambling code in the symbol form and to-be-scrambled information. The to-be-scrambled information may be a system message obtained after code modulation or a part of a system message obtained after code modulation.

According to a second aspect, a message receiving method is provided, including: determining, by a terminal, a first time parameter; receiving a scrambled system message on a physical broadcast channel; generating a scrambling code according to the first time parameter; and finally descrambling, by the terminal, the received scrambled system message according to the scrambling code.

Because the first time parameter has different values at at least two different moments in this embodiment of this application, scrambling codes used for system messages that are scrambled at the at least two corresponding different moments and that are received by the terminal may be different, so that performance of system message reception by the terminal is improved.

Based on the second aspect, in a possible implementation, the first time parameter is a function of at least one of a radio frame number, a timeslot number, a hyper frame number, or a symbol number.

For example, the first time parameter is a function of the radio frame number. The radio frame number is a radio frame number in which a start position for sending the system message is located. Cases of the timeslot number, the hyper frame number, and the symbol number are similar to this.

Because the radio frame number, the timeslot number, the hyper frame number, or the symbol number varies with time, and the first time parameter is a function of at least one of the radio frame number, the timeslot number, the hyper frame number, and or symbol number, the first time parameter is also a physical quantity that varies with time. Therefore, the scrambling code determined according to the first time parameter also varies with time.

Based on the second aspect, in a possible implementation, the first time parameter is any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number; or the first time parameter is a value resulting from any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number modulo a first modulus, where the first modulus is a positive integer.

A benefit of doing so is that complexity of system message detection by the terminal is reduced. Because the terminal does not know all information about the radio frame number when detecting the scrambled system message, the terminal needs to perform blind detection.

For example, when the system message is a MIB, in an NB-IoT, the terminal may know, by using a synchronization message, a value resulting from the radio frame number modulo 8, and a minimum repetition period of the MIB is eight radio frames. Therefore, when the first modulus is 8, the terminal may be prevented from performing more blind detection operations on the radio frame number, and good anti-interference gains can be achieved. Therefore, in the NB-IoT, the first modulus may be set to 8 when the system message is a MIB.

Based on the second aspect, in a possible implementation, the first modulus is 2^(n) where n is a positive integer that is not equal to 3; or the first modulus is 8; or the first modulus is a prime number.

When the first modulus is a prime number, a better anti-interference capability in sending of the system message can be achieved by using a feature of the prime number.

Based on the second aspect, a possible implementation in which the terminal generates the scrambling code according to the first time parameter is: the terminal generates a scrambling code initialization seed according to the first time parameter and a first variable group, where the first variable group includes at least one of a cell identity, an RNTI, or a carrier identifier; and then generates the scrambling code according to the scrambling code initialization seed.

Based on the second aspect, another possible implementation in which the terminal generates the scrambling code according to the first time parameter is: the terminal generates a scrambling code initialization seed according to the first time parameter, and then generates the scrambling code according to the scrambling code initialization seed.

Based on the second aspect, an embodiment of this application further provides several possible implementations in which the terminal generates the scrambling code initialization seed according to the first time parameter. The first time parameter is the radio frame number n_(f), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, and the initialization scrambling code seed c_(init) meets the following expression: c_(init)==n_(f) mod k, where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; or the first time parameter is the radio frame number n_(f), the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f)·2^(a) ¹ )+N_(ID) ^(cell), or c_(init)=(N_(ID) ^(cell)·2^(b) ¹ )+n_(f), where a₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init), and b₁ is a quantity of bits occupied by n_(f) in c_(init); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(a) ² +N_(ID) ^(cell), or c_(init)=N_(ID) ^(cell) 2^(b) ² +(n_(f) mod k), where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; a₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); and b₂ is a quantity of bits occupied by (n_(f) mod k) in c_(init); or the first time parameter is a value resulting from the radio frame number n_(f) (or the radio frame number plus an integer) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=[(n_(f)+h) mod k)+w]^(u)·P·2^(a) ³ +Q, or c_(init)=[(n_(f)+h)mod k)+w]^(u)·P+Q·2^(b) ³ , where h is an integer, for example, h is equal to 0 or 1; k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; w is an integer, for example, w is equal to 0 or 1; u is a non-negative integer, for example, 0, 1, 2, or 3; P is a function of the cell identity and/or the radio frame number, for example, is equal to the cell identity N_(ID) ^(cell), or is equal to N_(ID) ^(cell)+1, or is equal to N_(ID) ^(cell)·(n_(f) mod k)^(v), where v is a positive integer; Q is a function of the cell identity, for example, is equal to the cell identity, or is equal to 0 (meaning that there is no parameter Q in the formula); a₃ is a non-negative integer, for example, a₃ is equal to a quantity of bits occupied by Q in c_(init); and b₃ is a non-negative integer, for example, b₃ is equal to a quantity of bits occupied by [(n_(f)+h)mod k)+w]^(u)·P in c_(init).

Based on the second aspect, in a possible implementation, the descrambling may be bit-level descrambling or symbol-level descrambling. A specific implementation method is corresponding to the scrambling step performed by the base station in the first aspect.

According to a third aspect, a message sending method is provided, including: generating, by a base station, a scrambling code according to a first parameter, where the first parameter includes a radio frame number or a value resulting from the radio frame number modulo a first modulus, and the first modulus is a positive integer greater than or equal to 3; scrambling a first message according to the scrambling code; and finally sending the scrambled first message to a terminal on a first channel; or generating, by a terminal, a scrambling code according to a first parameter, where the first parameter includes a radio frame number or a value resulting from the radio frame number modulo a first modulus, and the first modulus is a positive integer greater than or equal to 3; scrambling a first message according to the scrambling code; and finally sending the scrambled first message to a base station on a first channel.

The radio frame number in this embodiment of this application is a radio frame number in which a start position for sending the first message is located.

In this embodiment of this application, the radio frame number varies with time, and the scrambling code generated by the base station or the terminal is determined according to the first parameter. The first parameter includes the radio frame number or the value resulting from the radio frame number modulo the first modulus, and the first modulus is a positive integer greater than or equal to 3. Therefore, there are at least three different moments for the determined scrambling code, and scrambling codes determined by the base station or the terminal at the at least three different moments are different. The first message is scrambled according to the scrambling code. Therefore, an anti-interference capability in transmission of the first message is improved according to the technical solution of this embodiment of this application.

Based on the third aspect, in a possible implementation, the first message may be a system message, or may be a part of a system message. The first message may be an encoded system message, or the first message is a part of an encoded system message. The first channel is a physical downlink shared channel or a physical broadcast channel. In another possible implementation, the first message may be data information or control information, or may be a part of data information or control information. The first message may be encoded data information or control information, or the first message is a part of encoded data information or control information. The first channel is a physical downlink shared channel, a physical downlink control channel, a physical uplink shared channel, or a physical uplink control channel.

Based on the third aspect, in a possible implementation, in addition to either of the radio frame number or the value resulting from the radio frame number modulo the first modulus, the first parameter includes at least one of an RNTI, a timeslot number, a symbol number, a cell identity, or a carrier identifier.

Based on the third aspect, in a possible implementation, the first modulus is 2^(n), where n is a positive integer greater than 1; or the first modulus is a prime number greater than or equal to 3.

When the first modulus is a prime number, a better anti-interference capability in sending of the first message can be achieved by using a feature of the prime number.

Based on the third aspect, a possible implementation in which the base station or the terminal generates the scrambling code according to the first parameter is: the base station or the terminal generates a scrambling code initialization seed according to the first parameter; and then generates the scrambling code according to the scrambling code initialization seed.

Based on the third aspect, an embodiment of this application further provides several possible implementations in which the base station or the terminal generates the scrambling code initialization seed according to the first parameter.

The first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the radio network temporary identifier n_(RNTI), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ¹ +(n_(f) mod k)·2^(b) ¹ └n_(s)/2┘·2^(c) ¹ +N_(ID) ^(cell), where a₁ is a sum of quantities of bits occupied by (n_(f) mod k), └n_(s)/2┘, and N_(ID) ^(cell) in c_(init), b₁ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ² +└n_(s)/2┘·2^(c) ² +N_(ID) ^(cell), where b₂ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ³ +└n_(s)/2┘·2^(c) ³ +N_(ID) ^(cell), where b₃ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₃ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)2^(a) ⁴ +(n_(f) mod k)·2^(b) ⁴ +N_(ID) ^(cell), where a₄ is a sum of quantities of bits occupied by (n_(f) mod k) and N_(ID) ^(cell) in c_(init), and b₄ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the cell identity N_(ID) ^(cell) and the value resulting from the radio frame number n_(f) modulo the first modulus k, and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ⁵ +N_(ID) ^(cell), where b₅ is a quantity of bits occupied by N_(ID) ^(Ncell) in c_(init); or the first parameter includes the radio frame number n_(f) and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ⁶ +N_(ID) ^(cell), where b₆ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes at least one of the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), or the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=R·2^(a) ⁷ +[(n_(f)+h)mod k)+w]^(u)·P·2^(b) ⁷ +H·2^(c) ⁷ +Q, where R is a function of the radio network temporary identifier, for example, is equal to the radio network temporary identifier n_(RNTI), or is equal to 0 (meaning that there is no parameter R in the formula); h is an integer, for example, is equal to 0 or 1; k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; w is an integer, for example, is equal to 0 or 1; u is a non-negative integer, for example, 0, 1, 2, or 3; P is a function of the cell identity and/or the radio frame number, for example, is equal to the cell identity N_(ID) ^(cell), or is equal to N_(ID) ^(cell)+1, or is equal to N_(ID) ^(cell)·(n_(f) mod k)^(v), where v is a positive integer; H is a function of the timeslot number, for example, is equal to the timeslot number n_(s), or is equal to 0 (meaning that there is no parameter H in the formula); Q is a function of the cell identity, for example, is equal to the cell identity, or is equal to 0 (meaning that there is no parameter Q in the formula); a₇ is a non-negative integer, for example, a₇ is equal to a sum of quantities of bits occupied by [(n_(f)+h)mod k)+w]^(u)·P, H, and Q in c_(init); b₇ is a non-negative integer, for example, b₃ is equal to a sum of quantities of bits occupied by H and Q in c_(init); and c₇ is a non-negative integer, for example, is equal to a quantity of bits occupied by Q in c_(init); or the first parameter includes at least one of the radio network temporary identifier n_(RNTI), the radio frame number n_(f), the timeslot number n_(s), or the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c _(init)=(k ₀ N _(ID) ^(cell) +k ₁)(k ₂ n _(f) +k ₃ └n _(s)/2┘+k ₄)^(u) ¹ ·2^(a) ⁸ +k ₅ N _(ID) ^(cell) +k ₆; or c _(init) =k ₁₈ n _(RNTI)·2^(b) ⁸ +(k ₇ N _(ID) ^(cell) +k ₈)(k ₉ n _(RNTI) +k ₁₀)[(k ₁₁ n _(f) +k ₁₂ └n _(s)/2┘+k ₁₃)mod k ₁₄ +k ₁₅]^(u) ² ·2^(c) ⁸ +k ₁₆ N _(ID) ^(cell) +k ₁₇; or c _(init)=(k ₁₉ N _(ID) ^(cell) +k ₂₀)(k ₂₁ n _(f) +k ₂₂)^(u) ³ (k ₂₃ └n _(s)/2┘+k ₂₄)^(u) ⁴ ·2^(d) ⁸ +k ₂₅ N _(ID) ^(cell) +k ₂₆; or c _(init) =k ₂₇ n _(RNTI)·2^(e) ⁸ +(k ₂₈ N _(ID) ^(cell) +k ₂₉)(k ₃₀ k _(RNTI) +k ₃₁)[(k ₃₂ n _(f) +k ₃₃)mod k ₃₄ +k ₃₅]^(u) ⁵ (k ₃₆ └n _(s)/2┘+k ₃₇)^(u) ⁶ ·2^(f) ⁸ +k ₃₈ N _(ID) ^(cell) +k ₃₉;

where k₀, k₁, . . . , and k₃₉ are non-negative integers; a₈, b₈, c₈, d₈, e₈, and f₈ are non-negative integers; and u₁, u₂, . . . , and u₆ are non-negative integers. For example, in a possible implementation method, k₀ is equal to 1, k₁ is equal to 0 or 1, k₂ is equal to 10, k₃ is equal to 1, k₄ is equal to 0 or 1, u₁ is equal to 1 or 2, a₈ is equal to 0 or 9, k₅ is equal to 0 or 1, and k₆ is equal to 0 or 1. In a possible implementation method, k₁₈ is equal to 0 or 1, b₈ is a non-negative integer, k₇ is equal to 1, k₈ is equal to 0 or 1, k₉ is equal to 0 or 1, k₁₀ is equal to 0 or 1, k₁₁ is equal to 10, k₁₂ is equal to 1, k₁₃ is equal to 0 or 1, k₁₄ is a prime number or an integer power of 2, k₁₅ is equal to 0 or 1, u₂ is equal to 1 or 2, c₈ is equal to 0 or 9, k₁₆ is equal to 0 or 1, and k₁₇ is equal to 0 or 1. In a possible implementation method, k₁₉ is equal to 1, k₂₀ is equal to 0 or 1, k₂₁ is equal to 1, k₂₂ is equal to 0 or 1, u₃ is equal to 1 or 2, k₂₃ is equal to 1, k₂₄ is equal to 0 or 1, u₄ is equal to 1 or 2, d₈ is equal to 0 or 9, k₂₅ is equal to 0 or 1, and k₂₆ is equal to 0 or 1. In a possible implementation method, k₂₇ is equal to 0 or 1, e₈ is a non-negative integer, k₂₅ is equal to 1, k₂₉ is equal to 0 or 1, k₃₀ is equal to 0 or 1, k₃₁ is equal to 0 or 1, k₃₂ is equal to 1, k₃₃ is equal to 0 or 1, k₃₄ is a prime number or an integer power of 2, k₃₅ is equal to 0 or 1, u₅ is equal to 1 or 2, k₃₆ is equal to 1, k₃₇ is equal to 0 or 1, u₆ is equal to 1 or 2, f₈ is equal to 0 or 9, k₃₈ is equal to 0 or 1, and k₃₉ is equal to 0 or 1.

It should be noted that the first parameter may further include at least one of the symbol number, the hyper frame number, or the carrier identifier. In this embodiment of this application, the RNTI, the timeslot number, the symbol number, the hyper frame number, the cell identity, the carrier identifier, and the like may all participate in the determining of the scrambling code initialization seed by using values resulting from them modulo the modulus. In addition, in this embodiment of this application, higher bits and lower bits in the bits occupied in c_(init) by the variables: the radio frame number n_(f), the value resulting from the radio frame number n_(f) modulo the first modulus k, the radio network temporary identifier n_(RNTI), the timeslot number n_(s), and the cell identity N_(ID) ^(cell) may be interchanged. This is not limited in this embodiment of this application.

Based on the third aspect, the base station sends, to the terminal, indication information used to indicate a manner of scrambling a first channel/first information.

Specifically, a possible implementation of the indication information used to indicate the manner of scrambling the first channel/first information is: The indication information may be used to indicate a manner of determining a scrambling code initialization seed of the first channel/first information and/or a scrambling code initialization method.

Specifically, the scrambling code initialization method includes at least one of a scrambling code length or a scrambling code initialization frequency/period.

The indication information may be located in a system message (a MIB or a SIB), and be sent by the base station to the terminal by using a PBCH or a PDSCH.

Based on the third aspect, the terminal reports terminal indication information to the base station, where the terminal indication information is used to indicate a scrambling manner support capability of the terminal.

In a communications system, a scrambling manner is usually characterized by incapability of full backward compatibility. Therefore, the terminal reports the scrambling manner support capability of the terminal, so that the base station can use a proper scrambling manner on data sent by the base station to the terminal, and the base station can also receive, in a correct scrambling manner, data sent by the terminal to the base station.

In a possible implementation method, the scrambling manner support capability of the terminal includes at least one of a quantity of scrambling manners supported by the terminal and whether the terminal supports or uses a scrambling manner. For example, the communications system supports two scrambling manners. A scrambling manner 1 is bit-level scrambling, in which a scrambling code is generated by using a scrambling code seed generation formula 1. A scrambling manner 2 is symbol-level scrambling, in which a scrambling code is generated by using a scrambling code seed generation formula 2. The terminal indication information may be used to indicate whether the terminal supports one scrambling manner or supports both of the two scrambling manners, and/or the terminal indication information may be used to indicate whether the terminal supports the scrambling manner 1 or 2.

In a possible implementation method, the terminal may report the terminal indication information to the base station by using RRC signaling or other higher layer signaling.

According to a fourth aspect, a message receiving method is provided, including: determining, by a terminal, a first parameter, where the first parameter includes a radio frame number or a value resulting from the radio frame number modulo a first modulus, and the first modulus is a positive integer greater than or equal to 3; receiving a scrambled first message on a first channel; generating a scrambling code according to the first parameter; and finally descrambling the received scrambled first message according to the scrambling code; or determining, by a base station, a first parameter, where the first parameter includes a radio frame number or a value resulting from the radio frame number modulo a first modulus, and the first modulus is a positive integer greater than or equal to 3; receiving a scrambled first message on a first channel; generating a scrambling code according to the first parameter; and finally descrambling the received scrambled first message according to the scrambling code.

Because the radio frame number or the value resulting from the radio frame number modulo the first modulus has different values at at least two different moments in this embodiment of this application, where the radio frame number and the value are included in the first parameter, scrambling codes used for first messages that are scrambled at the at least two corresponding different moments and that are received by the terminal or the base station may be different, so that performance of system message reception by the terminal is improved.

Based on the fourth aspect, in a possible implementation, the first message may be a system message, or may be a part of a system message. The first message may be an encoded system message, or the first message is a part of an encoded system message. The first channel is a physical downlink shared channel or a physical broadcast channel. In another possible implementation, the first message may be data information or control information, or may be a part of data information or control information. The first message may be encoded data information or control information, or the first message is a part of encoded data information or control information. The first channel is a physical downlink shared channel, a physical downlink control channel, a physical uplink shared channel, or a physical uplink control channel.

Based on the fourth aspect, in a possible implementation, in addition to either of the radio frame number or the value resulting from the radio frame number modulo the first modulus, the first parameter includes at least one of an RNTI, a timeslot number, a symbol number, a cell identity, or a carrier identifier.

Based on the fourth aspect, in a possible implementation, the first modulus is 2^(n), where n is a positive integer greater than 1; or the first modulus is a prime number greater than or equal to 3.

When the first modulus is a prime number, a better anti-interference capability in sending of the first message can be achieved by using a feature of the prime number.

Based on the fourth aspect, a possible implementation in which the terminal or the base station generates the scrambling code according to the first parameter is: the terminal or the base station generates a scrambling code initialization seed according to the first parameter; and then generates the scrambling code according to the scrambling code initialization seed.

Based on the fourth aspect, an embodiment of this application further provides several possible implementations in which the terminal or the base station generates the scrambling code initialization seed according to the first parameter.

The first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the radio network temporary identifier n_(RNTI), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ¹ +(n_(f) mod k)·2^(b) ¹ +└n_(s)/2┘·2^(c) ¹ +N_(ID) ^(cell), where a₁ is a sum of quantities of bits occupied by (n_(f) mod k), └n_(s)/2┘, and N_(ID) ^(cell) in c_(init), b₁ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ² +└n_(s)/2┘·2^(c) ² +N_(ID) ^(cell), where b₂ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ³ +└n_(s)/2┘·2^(c) ³ +N_(ID) ^(cell), where b₃ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₃ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ⁴ +(n_(f) mod k)·2^(b) ⁴ +N_(ID) ^(cell), where a₄ is a sum of quantities of bits occupied by (n_(f) mod and N_(ID) ^(cell) in c_(init), and b₄ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the cell identity N_(ID) ^(cell) and the value resulting from the radio frame number n_(f) modulo the first modulus k, and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ⁵ +N_(ID) ^(cell), where b₅ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f) and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ⁶ +N_(ID) ^(cell), where b₆ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes at least one of the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), or the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=R·2^(a) ⁷ +[(n_(f)+h)mod k)+w]^(u)·P·2^(b) ⁷ +H·2^(c) ⁷ +Q, where R is a function of the radio network temporary identifier, for example, is equal to the radio network temporary identifier n_(RNTI), or is equal to 0 (meaning that there is no parameter R in the formula); h is an integer, for example, is equal to 0 or 1; k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; w is an integer, for example, is equal to 0 or 1; u is a non-negative integer, for example, 0, 1, 2, or 3; P is a function of the cell identity and/or the radio frame number, for example, is equal to the cell identity N_(ID) ^(cell), or is equal to N_(ID) ^(cell)+1, or is equal to N_(ID) ^(cell)·(n_(f) mod k)^(v), where v is a positive integer; H is a function of the timeslot number, for example, is equal to the timeslot number n_(s), or is equal to 0 (meaning that there is no parameter H in the formula); Q is a function of the cell identity, for example, is equal to the cell identity, or is equal to 0 (meaning that there is no parameter Q in the formula); a₇ is a non-negative integer, for example, is equal to a sum of quantities of bits occupied by [(n_(f)+h)mod k)+w]^(u)·P, H, and Q in c_(init); b₇ is a non-negative integer, for example, is equal to a sum of quantities of bits occupied by H and Q in c_(init); and c₇ is a non-negative integer, for example, is equal to a quantity of bits occupied by Q in c_(init); or the first parameter includes at least one of the radio network temporary identifier n_(RNTI), the radio frame number n_(f), the timeslot number n_(s), or the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c _(init)=(k ₀ N _(ID) ^(cell) +k ₁)(k ₂ n _(f) +k ₃ └n _(s)/2┘+k ₄)^(u) ¹ ·2^(a) ⁸ +k ₅ N _(ID) ^(cell) +k ₆; or c _(init) =k ₁₈ n _(RNTI)·2^(b) ⁸ +(k ₇ N _(ID) ^(cell) +k ₈)(k ₉ n _(RNTI) +k ₁₀)[(k ₁₁ n _(f) +k ₁₂ └n _(s)/2┘+k ₁₃)mod k ₁₄ +k ₁₅]^(u) ² ·2^(c) ⁸ +k ₁₆ N _(ID) ^(cell) +k ₁₇; or c _(init)=(k ₁₉ N _(ID) ^(cell) +k ₂₀)(k ₂₁ n _(f) +k ₂₂)^(u) ³ (k ₂₃ └n _(s)/2┘+k ₂₄)^(u) ⁴ ·2^(d) ⁸ +k ₂₅ N _(ID) ^(cell) +k ₂₆; or c _(init) =k ₂₇ n _(RNTI)·2^(e) ⁸ +(k ₂₈ N _(ID) ^(cell) +k ₂₉)(k ₃₀ k _(RNTI) +k ₃₁)[(k ₃₂ n _(f) +k ₃₃)mod k ₃₄ +k ₃₅]^(u) ⁵ (k ₃₆ └n _(s)/2┘+k ₃₇)^(u) ⁶ ·2^(f) ⁸ +k ₃₈ N _(ID) ^(cell) +k ₃₉;

where k₀, k₁, . . . , and k₃₉ are non-negative integers; a₈, b₈, c₈, d₈, e₈, and f₈ are non-negative integers; and u₁, u₂, . . . , and u₆ are non-negative integers. For example, in a possible implementation method, k₀ is equal to 1, k₁ is equal to 0 or 1, k₂ is equal to 10, k₃ is equal to 1, k₄ is equal to 0 or 1, u₁ is equal to 1 or 2, a₈ is equal to 0 or 9, k₅ is equal to 0 or 1, and k₆ is equal to 0 or 1. In a possible implementation method, k₁₈ is equal to 0 or 1, b₈ is a non-negative integer, k₇ is equal to 1, k₈ is equal to 0 or 1, k₉ is equal to 0 or 1, k₁₀ is equal to 0 or 1, k₁₁ is equal to 10, k₁₂ is equal to 1, k₁₃ is equal to 0 or 1, k₁₄ is a prime number or an integer power of 2, k₅ is equal to 0 or 1, u₂ is equal to 1 or 2, c₈ is equal to 0 or 9, k₁₆ is equal to 0 or 1, and k₁₇ is equal to 0 or 1. In a possible implementation method, k₉ is equal to 1, k₂₀ is equal to 0 or 1, k₂₁ is equal to 1, k₂₂ is equal to 0 or 1, u₃ is equal to 1 or 2, k₂₃ is equal to 1, k₂₄ is equal to 0 or 1, u₄ is equal to 1 or 2, d₈ is equal to 0 or 9, k₂₅ is equal to 0 or 1, and k₂₆ is equal to 0 or 1. In a possible implementation method, k₂₇ is equal to 0 or 1, e₈ is a non-negative integer, k₂₅ is equal to 1, k₂₉ is equal to 0 or 1, k³⁰ is equal to 0 or 1, k₃₁ is equal to 0 or 1, k₃₂ is equal to 1, k₃₃ is equal to 0 or 1, k₃₄ is a prime number or an integer power of 2, k₃₅ is equal to 0 or 1, u₅ is equal to 1 or 2, k₃₆ is equal to 1, k₃₇ is equal to 0 or 1, u₆ is equal to 1 or 2, 18 is equal to 0 or 9, k₃₈ is equal to 0 or 1, and k₃₉ is equal to 0 or 1.

It should be noted that the first parameter may further include at least one of the symbol number, the hyper frame number, or the carrier identifier. In this embodiment of this application, the RNTI, the timeslot number, the symbol number, the hyper frame number, the cell identity, the carrier identifier, and the like may all participate in the determining of the scrambling code initialization seed by using values resulting from them modulo the modulus. In addition, in this embodiment of this application, higher bits and lower bits in the bits occupied in c_(init) by the variables: the radio frame number n_(f), the value resulting from the radio frame number n_(f) modulo the first modulus k, the radio network temporary identifier n_(RNTI), the timeslot number n_(s), and the cell identity N_(ID) ^(cell) may be interchanged. This is not limited in this embodiment of this application.

According to a fifth aspect, a base station is provided, including a processing module and a sending module, where the processing module is configured to: generate a scrambling code according to a first time parameter, and scramble a system message according to the scrambling code; and the sending module is configured to send, to a terminal on a physical broadcast channel, the system message scrambled by the processing module.

Based on the fifth aspect, in a possible implementation, the first time parameter is a function of at least one of a radio frame number, a timeslot number, a hyper frame number, or a symbol number.

Based on the fifth aspect, in a possible implementation, the first time parameter is any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number; or the first time parameter is a value resulting from any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number modulo a first modulus, where the first modulus is a positive integer.

Based on the fifth aspect, in a possible implementation, the first modulus is 2^(n), where n is a positive integer that is not equal to 3; or the first modulus is 8; or the first modulus is a prime number.

Based on the fifth aspect, a possible implementation in which the processing module generates the scrambling code according to the first time parameter is: generating a scrambling code initialization seed according to the first time parameter and a first variable group, and generating the scrambling code according to the scrambling code initialization seed, where the first variable group includes at least one of a cell identity, a radio network temporary identifier RNTI, or a carrier identifier.

Based on the fifth aspect, another possible implementation in which the processing module generates the scrambling code according to the first time parameter is: generating a scrambling code initialization seed according to the first time parameter, and generating the scrambling code according to the scrambling code initialization seed.

Based on the fifth aspect, an embodiment of this application further provides several possible implementations in which the base station generates the scrambling code initialization seed according to the first time parameter.

The first time parameter is the radio frame number n_(f), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f) mod k, where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; or the first time parameter is the radio frame number n_(f), the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f)·2^(a) ¹ )+N_(ID) ^(cell), or c_(init)=(N_(ID) ^(cell)·2^(b) ¹ )+n_(f), where a₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init), and b₁ is a quantity of bits occupied by n_(f) in c_(init); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(a) ² +N_(ID) ^(cell), or c_(init)=N_(ID) ^(cell)·2^(b) ² +(n_(f) mod k), where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; a₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); and b₂ is a quantity of bits occupied by (n_(f) mod k) in c_(init); or the first time parameter is a value resulting from the radio frame number n_(f) (or the radio frame number plus an integer) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=[(n_(f)+h)mod k)+w]^(u)·P·2^(a) ³ +Q, or c_(init)=[(n_(f)+h) mod k)+w]^(u)·P+Q·2^(b) ³ , where h is an integer, for example, is equal to 0 or 1; k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; w is an integer, for example, is equal to 0 or 1; u is a non-negative integer, for example, 0, 1, 2, or 3; P is a function of the cell identity and/or the radio frame number, for example, is equal to the cell identity N_(ID) ^(cell), or is equal to N_(ID) ^(cell)·(n_(f) mod k)^(v), where v is a positive integer; Q is a function of the cell identity, for example, is equal to the cell identity, or is equal to 0 (meaning that there is no parameter Q in the formula); a₃ is a non-negative integer, for example, is equal to a quantity of bits occupied by Q in c_(init); and b₃ is a non-negative integer, for example, is equal to a quantity of bits occupied by [(n_(f)+h)mod k)+w]^(u)·P in c_(init).

Based on the fifth aspect, in a possible implementation, the scrambling may be bit-level scrambling. For example, modulo-2 addition may be performed on the scrambling code and to-be-scrambled information. The to-be-scrambled information may be a system message or a part of a system message, or may be an encoded system message or a part of an encoded system message.

Based on the fifth aspect, in another possible implementation, the scrambling may be symbol-level scrambling. For example, the base station may first map the scrambling code from a bit form to a symbol form. A mapping method is not limited. For example, BPSK or QPSK modulation or another similar mapping method may be performed. Then, the base station performs a pointwise multiplication operation, a pointwise conjugate multiplication operation, or the like on the scrambling code in the symbol form and to-be-scrambled information. The to-be-scrambled information may be a system message obtained after code modulation or a part of a system message obtained after code modulation.

According to a sixth aspect, a terminal is provided, including a processing module and a receiving module, where the processing module is configured to determine a first time parameter; the receiving module is configured to receive a scrambled system message on a physical broadcast channel; and the processing module is further configured to: generate a scrambling code according to the first time parameter; and descramble, according to the scrambling code, the received system message scrambled by the processing module.

Based on the sixth aspect, in a possible implementation, the first time parameter is a function of at least one of a radio frame number, a timeslot number, a hyper frame number, or a symbol number.

Based on the sixth aspect, in a possible implementation, the first time parameter is any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number; or the first time parameter is a value resulting from any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number modulo a first modulus, where the first modulus is a positive integer.

Based on the sixth aspect, in a possible implementation, the first modulus is 2^(n), where n is a positive integer that is not equal to 3; or the first modulus is 8; or the first modulus is a prime number.

Based on the sixth aspect, a possible implementation in which the processing module generates the scrambling code according to the first time parameter is: generating a scrambling code initialization seed according to the first time parameter and a first variable group, and generating the scrambling code according to the scrambling code initialization seed, where the first variable group includes at least one of a cell identity, a radio network temporary identifier RNTI, or a carrier identifier.

Based on the sixth aspect, another possible implementation in which the processing module generates the scrambling code according to the first time parameter is: generating a scrambling code initialization seed according to the first time parameter, and generating the scrambling code according to the scrambling code initialization seed.

Based on the sixth aspect, an embodiment of this application further provides several possible implementations in which the processing module generates the scrambling code initialization seed according to the first time parameter.

The first time parameter is the radio frame number n_(f), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f) mod k, where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; or the first time parameter is the radio frame number n_(f), the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f)·2^(a) ¹ )+N_(ID) ^(cell), or c_(init)=N_(ID) ^(cell)·2^(b) ¹ )+n_(f), where a₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init), and b₁ is a quantity of bits occupied by n_(f) in c_(init); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(a) ² +N_(ID) ^(cell), or c_(init)=N_(ID) ^(cell)·2^(b) ² +(n_(f) mod k), where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; a₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); and b₂ is a quantity of bits occupied by (n_(f) mod k) in c_(init); or the first time parameter is a value resulting from the radio frame number n_(f) (or the radio frame number plus an integer) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)==[(n_(f)+h)mod k)+w]^(u)·P·2^(d) ³ +Q, or c_(init)=[(n_(f)+h) mod k)+w]^(u)·P+Q·2^(b) ³ , where h is an integer, for example, is equal to 0 or 1; k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; w is an integer, for example, is equal to 0 or 1; u is a non-negative integer, for example, 0, 1, 2, or 3; P is a function of the cell identity and/or the radio frame number, for example, is equal to the cell identity N_(ID) ^(cell), or is equal to N_(ID) ^(cell)·(n_(f) mod k)^(v), where v is a positive integer; Q is a function of the cell identity, for example, is equal to the cell identity, or is equal to 0 (meaning that there is no parameter Q in the formula); a₃ is a non-negative integer, for example, is equal to a quantity of bits occupied by Q in c_(init); and b₃ is a non-negative integer, for example, is equal to a quantity of bits occupied by [(n_(f)+h)mod k)+w]^(u)·P in c_(init).

Based on the sixth aspect, in a possible implementation, the descrambling may be bit-level descrambling or symbol-level descrambling. A specific implementation method is corresponding to the scrambling step performed by the base station in the fifth aspect.

According to a seventh aspect, a communications system is provided, including any base station provided in the fifth aspect and the terminal provided in the sixth aspect.

According to an eighth aspect, a base station or a terminal is provided, including a processing module and a sending module, where the processing module is configured to: generate a scrambling code according to a first parameter, and scramble a first message according to the scrambling code, where the first parameter includes a radio frame number or a value resulting from the radio frame number modulo a first modulus, and the first modulus is a positive integer greater than or equal to 3; and the sending module is configured to send, to the terminal or the base station on a first channel, the first message scrambled by the processing module.

Based on the eighth aspect, in a possible implementation, the first message is a system message, or the first message is a part of a system message; or the first message is an encoded system message, or the first message is a part of an encoded system message. The first channel is a physical downlink shared channel or a physical broadcast channel. In another possible implementation, the first message may be data information or control information, or may be a part of data information or control information. The first message may be encoded data information or control information, or the first message is a part of encoded data information or control information. The first channel is a physical downlink shared channel, a physical downlink control channel, a physical uplink shared channel, or a physical uplink control channel.

Based on the eighth aspect, in a possible implementation, in addition to the radio frame number or the value resulting from the radio frame number modulo the first modulus, the first parameter includes at least one of a radio network temporary identifier RNTI, a timeslot number, a symbol number, a cell identity, or a carrier identifier.

Based on the eighth aspect, in a possible implementation, the first modulus is 2^(n), where n is a positive integer greater than 1; or the first modulus is a prime number greater than or equal to 3.

Based on the eighth aspect, a possible implementation in which the processing module generates the scrambling code according to the first parameter is: generating a scrambling code initialization seed according to the first parameter, and generating the scrambling code according to the scrambling code initialization seed.

Based on the eighth aspect, an embodiment of this application further provides several possible implementations in which the processing module generates the scrambling code initialization seed according to the first time parameter.

The first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the radio network temporary identifier n_(RNTI), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ¹ +(n_(f) mod k)·2^(b) ¹ +└n_(s)/2┘·2^(c) ¹ +N_(ID) ^(cell), where a₁ is a sum of quantities of bits occupied by (n_(f) mod k), └n_(s)/2┘, and N_(ID) ^(cell) in c_(init), b₁ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ² +└n_(s)/2┘·2^(c) ² +N_(ID) ^(cell), where b₂ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ³ +└n_(s)/2┘·2^(c) ³ +N_(ID) ^(cell), where is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₃ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ⁴ +(n_(f) mod k)·2^(b) ⁴ +N_(ID) ^(cell) where, a₄ is a sum of quantities of bits occupied by (n_(f) mod k) and N_(ID) ^(cell) in c_(init), and b₄ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the cell identity N_(ID) ^(cell) and the value resulting from the radio frame number n_(f) modulo the first modulus k, and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ⁵ +N_(ID) ^(cell), where b₅ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f) and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ⁶ +N_(ID) ^(cell), where b₆ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes at least one of the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), or the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=R·2^(a) ⁷ +[(n_(f)+h)mod k)+w]^(u)·P·2^(b) ⁷ +H·2^(c) ⁷ +Q, where R is a function of the radio network temporary identifier, for example, is equal to the radio network temporary identifier n_(RNTI), or is equal to 0 (meaning that there is no parameter R in the formula); h is an integer, for example, is equal to 0 or 1; k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; w is an integer, for example, is equal to 0 or 1; u is a non-negative integer, for example, 0, 1, 2, or 3; P is a function of the cell identity and/or the radio frame number, for example, is equal to the cell identity N_(ID) ^(cell), or equal to N_(ID) ^(cell)+1, or is equal to N_(ID) ^(cell)·(n_(f) mod k)^(v), where v is a positive integer; H is a function of the timeslot number, for example, is equal to the timeslot number n_(s), or is equal to 0 (meaning that there is no parameter H in the formula); Q is a function of the cell identity, for example, is equal to the cell identity, or is equal to 0 (meaning that there is no parameter Q in the formula); a₇ is a non-negative integer, for example, is equal to a sum of quantities of bits occupied by [(n_(f)+h)mod k)+w]^(u)·P, H and Q in c_(init); b₇ is a non-negative integer, for example, is equal to a sum of quantities of bits occupied by H and Q in c_(init); and c₇ is a non-negative integer, for example, is equal to a quantity of bits occupied by Q in c_(init); or the first parameter includes at least one of the radio network temporary identifier n_(RNTI), the radio frame number n_(f), the timeslot number n_(s), or the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c _(init)=(k ₀ N _(ID) ^(cell) +k ₁)(k ₂ n _(f) +k ₃ └n _(s)/2┘+k ₄)^(u) ¹ ·2^(a) ⁸ +k ₅ N _(ID) ^(cell) +k ₆; or c _(init) =k ₁₈ n _(RNTI)·2^(b) ⁸ +(k ₇ N _(ID) ^(cell) +k ₈)(k ₉ n _(RNTI) +k ₁₀)[(k ₁₁ n _(f) +k ₁₂ └n _(s)/2┘+k ₁₃)mod k ₁₄ +k ₁₅]^(u) ² ·2^(c) ⁸ +k ₁₆ N _(ID) ^(cell) +k ₁₇; or c _(init)=(k ₁₉ N _(ID) ^(cell) +k ₂₀)(k ₂₁ n _(f) +k ₂₂)^(u) ³ (k ₂₃ └n _(s)/2┘+k ₂₄)^(u) ⁴ ·2^(d) ⁸ +k ₂₅ N _(ID) ^(cell) +k ₂₆; or c _(init) =k ₂₇ n _(RNTI)·2^(e) ⁸ +(k ₂₈ N _(ID) ^(cell) +k ₂₉)(k ₃₀ k _(RNTI) +k ₃₁)[(k ₃₂ n _(f) +k ₃₃)mod k ₃₄ +k ₃₅]^(u) ⁵ (k ₃₆ └n _(s)/2┘+k ₃₇)^(u) ⁶ ·2^(f) ⁸ +k ₃₈ N _(ID) ^(cell) +k ₃₉;

where k₀, k₁, . . . , and k₃₉ are non-negative integers; a₈, b₈, c₈, d₈, e₈, and f₈ are non-negative integers; and u₁, u₂, . . . , and u₆ are non-negative integers. For example, in a possible implementation method, k₀ is equal to 1, k₁ is equal to 0 or 1, k₂ is equal to 10, k₃ is equal to 1, k₄ is equal to 0 or 1, u₁ is equal to 1 or 2, a₈ is equal to 0 or 9, k₅ is equal to 0 or 1, and k₆ is equal to 0 or 1. In a possible implementation method, k₁₈ is equal to 0 or 1, b₈ is a non-negative integer, k₇ is equal to 1, k₈ is equal to 0 or 1, k₉ is equal to 0 or 1, k₁₀ is equal to 0 or 1, k₁₁ is equal to 10, k₁₂ is equal to 1, k₁₃ is equal to 0 or 1, k₁₄ is a prime number or an integer power of 2, k₁₅ is equal to 0 or 1, u₂ is equal to 1 or 2, c₈ is equal to 0 or 9, k₁₆ is equal to 0 or 1, and k₁₇ is equal to 0 or 1. In a possible implementation method, k₁₉ is equal to 1, k₂₀ is equal to 0 or 1, k₂₁ is equal to 1, k₂₂ is equal to 0 or 1, u₃ is equal to 1 or 2, k₂₃ is equal to 1, k₂₄ is equal to 0 or 1, u₄ is equal to 1 or 2, d₈ is equal to 0 or 9, k₂₅ is equal to 0 or 1, and k₂₆ is equal to 0 or 1. In a possible implementation method, k₂₇ is equal to 0 or 1, e₈ is a non-negative integer, k₂₈ is equal to 1, k₂₉ is equal to 0 or 1, k₃₀ is equal to 0 or 1, k₃₁ is equal to 0 or 1, k₃₂ is equal to 1, k₃₃ is equal to 0 or 1, k₃₄ is a prime number or an integer power of 2, k₃₅ is equal to 0 or 1, u₅ is equal to 1 or 2, k₃₆ is equal to 1, k₃₇ is equal to 0 or 1, u₆ is equal to 1 or 2, f₈ is equal to 0 or 9, k₃₈ is equal to 0 or 1, and k₃₉ is equal to 0 or 1.

According to a ninth aspect, a terminal or a base station is provided, including a processing module and a receiving module, where the processing module is configured to determine a first parameter, where the first parameter includes a radio frame number or a value resulting from the radio frame number modulo a first modulus, and the first modulus is a positive integer greater than or equal to 3; the receiving module is configured to receive a scrambled first message on a first channel; and the processing module is further configured to: generate a scrambling code according to the first parameter; and descramble, according to the scrambling code, the received first message scrambled by the processing module.

Based on the ninth aspect, in a possible implementation, the first message is a system message, or the first message is a part of a system message; or the first message is an encoded system message, or the first message is a part of an encoded system message. The first channel is a physical downlink shared channel or a physical broadcast channel. In another possible implementation, the first message may be data information or control information, or may be a part of data information or control information. The first message may be encoded data information or control information, or the first message is a part of encoded data information or control information. The first channel is a physical downlink shared channel, a physical downlink control channel, a physical uplink shared channel, or a physical uplink control channel.

Based on the ninth aspect, in a possible implementation, in addition to the radio frame number or the value resulting from the radio frame number modulo the first modulus, the first parameter includes at least one of a radio network temporary identifier RNTI, a timeslot number, a symbol number, a cell identity, or a carrier identifier.

Based on the ninth aspect, in a possible implementation, the first modulus is 2^(n), where n is a positive integer greater than 1; or the first modulus is a prime number greater than or equal to 3.

Based on the ninth aspect, a possible implementation in which the processing module generates the scrambling code according to the first parameter is: generating a scrambling code initialization seed according to the first parameter, and generating the scrambling code according to the scrambling code initialization seed.

Based on the ninth aspect, an embodiment of this application further provides several possible implementations in which the processing module generates the scrambling code initialization seed according to the first time parameter.

The first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the radio network temporary identifier n_(RNTI), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ¹ +(n_(f) mod k)·2^(b) ¹ +└n_(s)/2┘·2^(c) ¹ +N_(ID) ^(cell), where a₁ is a sum of quantities of bits occupied by (n_(f) mod k), └n_(s)/2┘, and N_(ID) ^(cell) in c_(init), b₁ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ² +└n_(s)/2┘·2^(c) ² +N_(ID) ^(cell), where b₂ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ³ +└n_(s)/2┘·2^(c) ³ +N_(ID) ^(cell), where b₃ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₃ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ⁴ +(n_(f) mod k)·2^(b) ⁴ +N_(ID) ^(cell), where a₄ is a sum of quantities of bits occupied by (n_(f) mod k) and N_(ID) ^(cell) in c_(init), and b₄ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the cell identity N_(ID) ^(cell) and the value resulting from the radio frame number n_(f) modulo the first modulus k, and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ⁵ +N_(ID) ^(cell), where b₆ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f) and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ⁶ +N_(ID) ^(cell), where b₆ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes at least one of the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), or the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=R·2^(a) ⁷ +[(n_(f)+h)mod k)+w]^(u)·P·2^(b) ⁷ +H·2^(c) ⁷ +Q, where R is a function of the radio network temporary identifier, for example, is equal to the radio network temporary identifier n_(RNTI), or is equal to 0 (meaning that there is no parameter R in the formula); h is an integer, for example, is equal to 0 or 1; k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; w is an integer, for example, is equal to 0 or 1; u is a non-negative integer, for example, 0, 1, 2, or 3; P is a function of the cell identity and/or the radio frame number, for example, is equal to the cell identity N_(ID) ^(cell), or is equal to N_(ID) ^(cell)+1, or is equal to N_(ID) ^(cell)·(n_(f) mod k)^(v), where v is a positive integer; H is a function of the timeslot number, for example, is equal to the timeslot number n_(s), or is equal to 0 (meaning that there is no parameter H in the formula); Q is a function of the cell identity, for example, is equal to the cell identity, or is equal to 0 (meaning that there is no parameter Q in the formula); a₇ is a non-negative integer, for example, is equal to a sum of quantities of bits occupied by [(n_(f)+h)mod k)+w]^(u)·P, H and Q in c_(init); b₇ is a non-negative integer, for example, is equal to a sum of quantities of bits occupied by H and Q in c_(init); and c₇ is a non-negative integer, for example, is equal to a quantity of bits occupied by Q in c_(init); or the first parameter includes at least one of the radio network temporary identifier n_(RNTI), the radio frame number n_(f), the timeslot number n_(s), or the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c _(init)=(k ₀ N _(ID) ^(cell) +k ₁)(k ₂ n _(f) +k ₃ └n _(s)/2┘+k ₄)^(u) ¹ ·2^(a) ⁸ +k ₅ N _(ID) ^(cell) +k ₆; or c _(init) =k ₁₈ n _(RNTI)·2^(b) ⁸ +(k ₇ N _(ID) ^(cell) +k ₈)(k ₉ n _(RNTI) +k ₁₀)[(k ₁₁ n _(f) +k ₁₂ └n _(s)/2┘+k ₁₃)mod k ₁₄ +k ₁₅]^(u) ² ·2^(c) ⁸ +k ₁₆ N _(ID) ^(cell) +k ₁₇; or c _(init)=(k ₁₉ N _(ID) ^(cell) +k ₂₀)(k ₂₁ n _(f) +k ₂₂)^(u) ³ (k ₂₃ └n _(s)/2┘+k ₂₄)^(u) ⁴ ·2^(d) ⁸ +k ₂₅ N _(ID) ^(cell) +k ₂₆; or c _(init) =k ₂₇ n _(RNTI)·2^(e) ⁸ +(k ₂₈ N _(ID) ^(cell) +k ₂₉)(k ₃₀ k _(RNTI) +k ₃₁)[(k ₃₂ n _(f) +k ₃₃)mod k ₃₄ +k ₃₅]^(u) ⁵ (k ₃₆ └n _(s)/2┘+k ₃₇)^(u) ⁶ ·2^(f) ⁸ +k ₃₈ N _(ID) ^(cell) +k ₃₉;

where k₀, k₁, . . . , and k₃₉ are non-negative integers; a₈, b₈, c₈, d₈, e₈, and f₈ are non-negative integers; and u₁, u₂, . . . , and u₆ are non-negative integers. For example, in a possible implementation method, k₀ is equal to 1, k₁ is equal to 0 or 1, k₂ is equal to 10, k₃ is equal to 1, k₄ is equal to 0 or 1, u₁ is equal to 1 or 2, a₈ is equal to 0 or 9, k₅ is equal to 0 or 1, and k₆ is equal to 0 or 1. In a possible implementation method, k₁₈ is equal to 0 or 1, b₈ is a non-negative integer, k₇ is equal to 1, k₈ is equal to 0 or 1, k₉ is equal to 0 or 1, k₁₀ is equal to 0 or 1, k₁₁ is equal to 10, k₁₂ is equal to 1, 13 is equal to 0 or 1, k₁₄ is a prime number or an integer power of 2, k₁₅ is equal to 0 or 1, u₂ is equal to 1 or 2, c₈ is equal to 0 or 9, k₁₆ is equal to 0 or 1, and k₁₇ is equal to 0 or 1. In a possible implementation method, k₁₉ is equal to 1, k₂₀ is equal to 0 or 1, k₂₁ is equal to 1, k₂₂ is equal to 0 or 1, u₃ is equal to 1 or 2, k₂₃ is equal to 1, k₂₄ is equal to 0 or 1, u₄ is equal to 1 or 2, d₈ is equal to 0 or 9, k₂₅ is equal to 0 or 1, and k₂₆ is equal to 0 or 1. In a possible implementation method, k₂₇ is equal to 0 or 1, e₈ is a non-negative integer, k₂₈ is equal to 1, k₂₉ is equal to 0 or 1, k₃₀ is equal to 0 or 1, k₃₁ is equal to 0 or 1, k₃₂ is equal to 1, k₃₃ is equal to 0 or 1, k₃₄ is a prime number or an integer power of 2, k₃₅ is equal to 0 or 1, u₅ is equal to 1 or 2, k₃₆ is equal to 1, k₃₇ is equal to 0 or 1, u₆ is equal to 1 or 2, f₈ is equal to 0 or 9, k₃₈ is equal to 0 or 1, and k₃₉ is equal to 0 or 1.

According to a tenth aspect, a communications system is provided, including any base station according to the eighth aspect and the terminal provided in the ninth aspect, or including any terminal according to the eighth aspect and the base station provided in the ninth aspect.

According to an eleventh aspect, a message sending method is provided, including: generating, by a base station, a scrambling code according to a cell identity and/or a first time parameter; then scrambling a system message according to the scrambling code; and finally sending the scrambled system message to a terminal on a first channel.

The first time parameter is a function of at least one of a radio frame number, a timeslot number, a hyper frame number, or a symbol number. The first channel is a physical broadcast channel or a physical downlink shared channel. The system message is a MIB or a SIB.

The scrambling, by the base station, a system message according to the scrambling code specifically includes: repeating, by the base station, the system message, and scrambling repeated system messages together. The scrambling, by the base station, repeated system messages together specifically includes: scrambling, by the base station, the repeated system messages by using a complete scrambling code generated by using an initialization seed, where a quantity of symbols or a quantity of bits included in the complete scrambling code generated by using the initialization seed is equal to a quantity of symbols or a quantity of bits included in the repeated system messages.

Based on the eleventh aspect, in a possible implementation, the scrambling may be bit-level scrambling. For example, modulo-2 addition may be performed on the scrambling code and to-be-scrambled information. The to-be-scrambled information may be a system message or a part of a system message, or may be an encoded system message or a part of an encoded system message.

Based on the eleventh aspect, in another possible implementation, the scrambling may be symbol-level scrambling. For example, the base station may first map the scrambling code from a bit form to a symbol form. A mapping method is not limited. For example, BPSK or QPSK modulation or another similar mapping method may be performed. Then, the base station performs a pointwise multiplication operation, a pointwise conjugate multiplication operation, or the like on the scrambling code in the symbol form and to-be-scrambled information. The to-be-scrambled information may be a system message obtained after code modulation or a part of a system message obtained after code modulation.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a schematic flowchart of a message transmission method according to an embodiment of this application;

FIG. 2 is a schematic structural diagram of a radio frame in LTE;

FIG. 3 is a schematic flowchart of a message transmission method according to an embodiment of this application;

FIG. 4 a is a schematic structural diagram of a base station according to an embodiment of this application;

FIG. 4 b is a schematic structural diagram of hardware of a base station according to an embodiment of this application;

FIG. 5 a is a schematic structural diagram of a terminal according to an embodiment of this application;

FIG. 5 b is a schematic structural diagram of hardware of a terminal according to an embodiment of this application;

FIG. 6 is a schematic diagram of a communications system according to an embodiment of this application;

FIG. 7 a is a schematic structural diagram of a base station according to an embodiment of this application;

FIG. 7 b is a schematic structural diagram of hardware of a base station according to an embodiment of this application;

FIG. 8 a is a schematic structural diagram of a terminal according to an embodiment of this application;

FIG. 8 b is a schematic structural diagram of hardware of a terminal according to an embodiment of this application; and

FIG. 9 is a schematic diagram of a communications system according to an embodiment of this application.

DESCRIPTION OF EMBODIMENTS

The following further describes the embodiments of this application in detail with reference to the accompanying drawings.

The embodiments of this application may be applied to an LTE (Long Term Evolution) system, or may be applied to other wireless communications systems, such as a GSM (Global System for Mobile Communications), a UMTS (Universal Mobile Telecommunications System), a CDMA (Code Division Multiple Access) system, and a new network system such as a 5G (5th-Generation) network system.

Abase station in the embodiments of this application may be configured to perform conversion between a received over-the-air frame and an IP (Internet Protocol) packet, and serve as a router between a wireless terminal and a remaining part of an access network. The remaining part of the access network may include an IP network. The base station in the embodiments of this application may be further configured to coordinate attribute management on an air interface. For example, the base station in the embodiments of this application may be a BTS (base transceiver station) in a GSM system or a CDMA system, may be a NodeB in WCDMA (Wideband Code Division Multiple Access), or may be an eNB (evolved NodeB) in an LTE system. This is not limited in the embodiments of this application.

A terminal in the embodiments of this application may be a device configured to provide a user with voice and/or data connectivity, a handheld device with a wireless connection function, or another processing device connected to a wireless modem. Alternatively, the terminal may be a wireless terminal. The wireless terminal may communicate with one or more core networks through a RAN (radio access network). The wireless terminal may be a mobile terminal, such as a mobile phone (or referred to as a “cellular” phone) or a computer with a mobile terminal. For example, the computer with a mobile terminal may be a portable, pocket-sized, handheld, computer built-in, or in-vehicle mobile apparatus, which exchanges voice and/or data with the radio access network. For example, alternatively, the wireless terminal may be a device such as a PCS (personal communication service) phone, a cordless phone, a SIP (Session Initiation Protocol) phone, a WLL (wireless local loop) station, or a PDA (personal digital assistant). The wireless terminal may also be referred to as a system, a subscriber unit, a subscriber station, a mobile station, a mobile, a remote station, an access point, a remote terminal, an access terminal, a user terminal, a user agent, a user device, user equipment, or the like.

In the embodiments of this application, a time variable is added in a scrambling code generation process so that, among scrambling codes generated by the base station, scrambling codes generated at some two different moments are different. Because the scrambling codes determined at the two different moments are different, anti-interference performance in system message transmission is improved.

Embodiment 1

For a system message such as a MIB transmitted on a physical broadcast channel, specifically, as shown in FIG. 1 , a message sending method in this embodiment of this application includes the following steps.

Step 100: A base station generates a scrambling code according to a first time parameter.

It should be noted that the first time parameter has different values at at least two different moments in this embodiment of this application. Because the first time parameter has different values at the at least two different moments, scrambling codes generated at the at least two corresponding different moments are different. Therefore, a possibility at which the base station uses a same scrambling code to scramble a same system message repeatedly in a time period is reduced, so that an anti-interference capability in system message transmission is improved.

Step 110: The base station scrambles a system message according to the scrambling code.

It should be noted that, in this embodiment of this application, the system message may be a complete system message, or may be a part of a complete system message. The system message may be an encoded system message, or may be an uncoded system message. For example, when the complete system message is a MIB, the system message in this embodiment of this application may be the MIB, or may be a part of a MIB. When the system message in this embodiment of this application is a MIB, the MIB may be an encoded MIB, or may be a MIB before encoding. When the system message in this embodiment of this application is a part of a MIB, the part may be a part of an encoded MIB, or may be a part of an uncoded MIB.

Step 120: The base station sends the scrambled system message to a terminal on a physical broadcast channel.

For example, this embodiment of this application may also be applied to a channel other than the physical broadcast channel, for example, a channel such as a PDSCH (physical downlink shared channel), a PUSCH (physical uplink shared channel), a PDCCH (physical downlink control channel), a PUCCH (physical uplink control channel), a PCFICH (physical control format indicator channel), a PMCH (physical multicast channel), or a PRACH (physical random access channel). Names of the channels are all provided according to an LTE conventional naming rule, but the channels may have other names in another communications system. For example, the physical broadcast channel is named NPBCH (narrowband physical broadcast channel) in an NB-IoT (Narrowband Internet of Things). Further details are not described herein.

Step 130: The terminal determines the first time parameter.

For example, specifically, before sending the scrambled system message to the terminal, the base station sends a synchronization message to the terminal. The synchronization message may be used to indicate information about the first time parameter (or a part of information about the first time parameter; for example, when the first time parameter is a radio frame number in an NB-IoT system, the terminal may use the synchronization message to determine a value resulting from the radio frame number modulo 8). The first time parameter is a parameter used as a basis when the base station generates the scrambling code. The scrambling code is a scrambling code used by the base station to scramble the system message. The terminal determines the first time parameter according to the synchronization message sent by the base station. Step 130 in which the terminal determines the first time parameter may be performed before step 120, or may be performed after step 120. Alternatively, step 130 and step 120 may be simultaneously performed.

Step 140: The terminal receives the scrambled system message on the physical broadcast channel.

It should be understood that, when the base station sends the scrambled system message on another channel, the terminal receives the scrambled system message on the corresponding channel. A PDSCH is used as an example. When the base station sends the scrambled system message on the PDSCH, the terminal receives the scrambled system message on the PDSCH.

Step 150: The terminal generates a scrambling code according to the first time parameter.

For example, a manner in which the terminal generates the scrambling code according to the first time parameter is similar to a manner in which the base station generates the scrambling code according to the first time parameter. Details are not described herein again.

It should be noted that there is no definite sequence for step 140 and step 130 and for step 140 and step 150; and step 130 is performed before step 150.

Step 160: The terminal descrambles the received scrambled system message according to the scrambling code.

For example, in this embodiment of this application, the first time parameter may be a function of at least one of a radio frame number, a timeslot number, a hyper frame number, or a symbol number.

For example, the first time parameter is a function of the radio frame number. If the first time parameter is y, and the radio frame number is n_(f), y=f(n_(f)), where f( ) is a function relationship between y and n_(f). A specific function relationship is determined according to a policy preset in the base station. For example, f( ) is a linear function, a slope is 2, and an intercept is 0. In this case, y=2·n_(f). Alternatively, the first time parameter may be a function of any one or more of a radio frame number, a timeslot number, a hyper frame number, and a symbol number. Details are not described herein.

For example, the radio frame number in this embodiment of this application may be a radio frame number in which a start position for sending the system message is located, or the radio frame number may be a radio frame number in which a last location for sending the system message is located, or the like. Cases of the timeslot number, the hyper frame number, and the symbol number are similar to this, and are not described herein.

Because the radio frame number, the timeslot number, the hyper frame number, or the symbol number used to carry the system message varies with time, and the first time parameter is a function of at least one of the radio frame number, the timeslot number, the hyper frame number, or the symbol number, the first time parameter is also a physical quantity that varies with time, for example, a subframe number. Therefore, the scrambling code determined according to the first time parameter also varies with time.

For example, alternatively, the first time parameter may be another physical quantity that varies with time, for example, a subframe number, without being limited to the radio frame number, the timeslot number, the hyper frame number, and the symbol number in this embodiment of this application.

Specifically, as shown in FIG. 2 , FIG. 2 is a schematic diagram of a frame structure of a radio frame in an LTE system. The radio frame may have another name in another communications system.

A hyper frame includes one or more radio frames.

For example, in this embodiment of this application, the first time parameter is any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number; or the first time parameter is a value resulting from any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number modulo a first modulus, where the first modulus is a positive integer.

For example, a value of the first modulus may be 2^(n), where n is a positive integer. For example, the value of the first modulus may be 2, 4, 8, 16, 32, 64, 128, 256, or 512. Alternatively, the value of the first modulus may be a prime number, such as 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, or 61. For example, the first time parameter is the radio frame number. The first time parameter is a value resulting from the radio frame number modulo the first modulus. Therefore, a benefit of doing so is that complexity of system message detection by the terminal is reduced. Because the terminal may not know all information about the radio frame number when detecting the scrambled system message, the terminal needs to perform blind detection.

For example, when the system message is a MIB, in an NB-IoT, the terminal may know, by using a synchronization message, a value resulting from the radio frame number modulo 8, and a minimum repetition period of the MIB is eight radio frames. Therefore, when the first modulus is 8, the terminal may be prevented from performing more blind detection operations on the radio frame number, and good anti-interference gains can be achieved. Therefore, in the NB-IoT, the first modulus is usually set to 8 when the system message is a MIB.

In addition, in step 100, the base station generates the scrambling code according to the first time parameter. Specifically, the scrambling code may be directly generated according to the first time parameter. It is assumed that the first time parameter is the radio frame number, and the scrambling code may be the radio frame number represented by using a binary system.

In addition, a base station may generate a scrambling code according to a first time parameter in two different implementations. One possible implementation is: The base station generates a scrambling code initialization seed according to the first time parameter, and then generates the scrambling code according to the scrambling code initialization seed. The other possible implementation is: The base station generates a scrambling code initialization seed according to the first time parameter and a first variable group, and then generates the scrambling code according to the scrambling code initialization seed. The first variable group includes at least one of a cell identity, a radio network temporary identifier RNTI, or a carrier identifier. It should be understood that, because a manner of generating the scrambling code according to the scrambling code initialization seed in this embodiment of this application is similar to that in the prior art, details are not described herein.

The base station generates the scrambling code initialization seed according to the first time parameter. Specifically, the first time parameter is the radio frame number n_(f), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f). Alternatively, the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f) mod k, where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number. It should be noted that, c_(init)=n_(f) is used as an example, and linear deformation may also be performed on c_(init)=n_(f). An example in which n_(f) is represented by using a binary system is used. In this case, when a condition that a sequence length of the scrambling code initialization seed is not greater than a preset threshold is met, c_(init)=n_(f) may be deformed into c_(init)=n_(f)+N, where N is a preset constant binary sequence; or c_(init)=n_(f) may be deformed into c_(init)=2^(n)·n_(f)+N, where n is a quantity of bits occupied by the constant binary sequence N in c_(init). Alternatively, deformation similar to that performed on c_(init)=n_(f) may be performed when c_(init)=n_(f) mod k. It should be understood that, a manner used when the first time parameter is the timeslot number, the hyper frame number, or the symbol number is similar to that used when the first time parameter is the radio frame number n_(f), and details are not described herein.

c_(init)=2^(n)·n_(f)+N is used as an example. It is assumed that a length of c_(init) is 16, n_(f)=1011 0111, N=1100 0101, and n=8. In this case, in c_(init), n_(f) is higher eight bits, and N is lower eight bits. c_(init)=1011 0111 1100 0101.

The base station generates the scrambling code initialization seed according to the first time parameter and the first variable group. For example, the first time parameter is the radio frame number n_(f), the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f)·2^(a) ¹ )+N_(ID) ^(cell), where a₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(N_(ID) ^(cell)·2^(b) ¹ )+n_(f), where b₁ is a quantity of bits occupied by n_(f) in c_(init).

In another possible example, the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(a) ² +N_(ID) ^(cell), where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; and a₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(N_(ID) ^(cell)·2^(b) ² +(n_(f) mod k), where b₂ is a quantity of bits occupied by (n_(f) mod k) in c_(init).

In another possible example, the first time parameter is a value resulting from the radio frame number n_(f) (or the radio frame number plus an integer) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=[(n_(f)+h)mod k)+w]^(u)·P·2^(a) ³ +Q, or c_(init)=[(n_(f)+h)mod k)+w]^(u)·P+Q·2^(b) ³ , where h is an integer, for example, is equal to 0 or 1; k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; w is an integer, for example, is equal to 0 or 1; u is a non-negative integer, for example, 0, 1, 2, or 3; P is a function of the cell identity and/or the radio frame number, for example, is equal to the cell identity N_(ID) ^(cell), or is equal to N_(ID) ^(cell)·(n_(f) mod k)^(v), where v is a positive integer; Q is a function of the cell identity, for example, is equal to the cell identity, or is equal to 0 (meaning that there is no parameter Q in the formula); a₃ is a non-negative integer, for example, is equal to a quantity of bits occupied by Q in c_(init); and b₃ is a non-negative integer, for example, is equal to a quantity of bits occupied by [(n_(f)+h)mod k)+w]^(u)·P in c_(init).

In this embodiment, the scrambling may be bit-level scrambling. For example, modulo-2 addition may be performed on the scrambling code and to-be-scrambled information. The to-be-scrambled information may be a system message or a part of a system message, or may be an encoded system message or a part of an encoded system message.

In this embodiment, the scrambling may be symbol-level scrambling. For example, the base station may first map the scrambling code from a bit form to a symbol form. A mapping method is not limited. For example, BPSK or QPSK modulation or another similar mapping method may be performed. Then, the base station performs a pointwise multiplication operation, a pointwise conjugate multiplication operation, or the like on the scrambling code in the symbol form and to-be-scrambled information. The to-be-scrambled information may be a system message obtained after code modulation or a part of a system message obtained after code modulation.

It should be noted that, in this embodiment of this application, c_(init)=N_(ID) ^(cell), n_(f), and n_(f) mod k are all represented by using a binary system. c_(init)=(n_(f)·2^(a) ¹ )+N_(ID) ^(cell) is used as an example. When n_(f) is multiplied by 2^(a) ¹ , N_(ID) ^(cell) occupies lower a₁ bits in c_(init).

It should be noted that, in this embodiment of this application, the RNTI, the timeslot number, the symbol number, the hyper frame number, the cell identity, the carrier identifier, and the like may all participate in the generation of the scrambling code initialization seed by using values resulting from them modulo the modulus. Specifically, the modulus may be a positive integer, such as a prime number or a power of 2. For example, c_(init)=n_(f)·2^(a) ² +(N_(ID) ^(cell) mod k).

Embodiment 2

For a first message such as a SIB 1 in a physical downlink shared channel, as shown in FIG. 3 , a message sending method in this embodiment of this application includes the following steps.

Step 300: A base station generates a scrambling code according to a first parameter, where the first parameter includes a radio frame number or a value resulting from the radio frame number modulo a first modulus, and the first modulus is a positive integer greater than or equal to 3.

For example, the radio frame number in this embodiment of this application may be a radio frame number in which a start position for sending a first message is located, or the radio frame number may be a radio frame number in which a last location for sending a first message is located, or the like. Cases of a timeslot number, a hyper frame number, and a symbol number are similar to this, and are not described herein.

It should be noted that, in this embodiment of this application, the radio frame number varies with time, and the scrambling code generated by the base station is determined according to the first parameter. The first parameter includes the radio frame number or the value resulting from the radio frame number modulo the first modulus, and the first modulus is a positive integer greater than or equal to 3. Therefore, there are at least three different moments for the determined scrambling code, and scrambling codes generated by the base station at the at least three different moments are different. The first message is scrambled according to the scrambling code. Therefore, an anti-interference capability in transmission of the first message is improved according to this embodiment of this application.

For example, the first message is a SIB 1. In an NB-IoT, radio frame numbers that carry the SIB 1 are separated by an even quantity of radio frame numbers. Therefore, when the first modulus is a positive integer greater than or equal to 3, there are at least three different values for the value resulting from the time-varying radio frame number modulo the first modulus.

Step 310: The base station scrambles a first message according to the scrambling code.

Specifically, the first message may be a complete system message, or may be a part of a complete system message. Alternatively, the first message may be an encoded system message, or may be a part of an encoded system message. It should be noted that, alternatively, the first message may be a system message before encoding, or may be a part of a system message before encoding. For example, when the complete system message is a SIB 1, the first message in this embodiment of this application may be a SIB 1; and specifically, the first message may be an encoded SIB 1, or may be an uncoded SIB 1. Alternatively, the first message may be a part of a SIB1; and specifically, the first message may be a part of an encoded SIB 1, or may be a part of an uncoded SIB 1.

Step 320: The base station sends the scrambled first message to a terminal on a first channel.

In this embodiment of this application, the first channel may be a physical downlink shared channel.

In addition, this embodiment of this application may be applied to a channel in addition to the physical downlink shared channel, for example, a channel such as a PUSCH, a PDCCH, a PUCCH, a PCFICH, a PMCH, or a PRACH. Names of the channels are all provided according to an LTE conventional naming rule, but the channels may have other names in another communications system. For example, the physical downlink shared channel is named an NPDSCH (narrowband physical downlink shared channel) in the NB-IoT. Details are not described herein.

Step 330: The terminal determines the first parameter.

Specifically, before sending the scrambled first message to the terminal, the base station sends a synchronization message to the terminal. The synchronization message may be used to indicate information about the first parameter (or a part of information about the first parameter; for example, when the first parameter includes only a radio frame number in an NB-IoT system, the terminal may use the synchronization message to determine a value resulting from the radio frame number modulo 8). The first parameter is a parameter used as a basis when the base station generates the scrambling code. The scrambling code is a scrambling code used by the base station to scramble the first message. The terminal determines the first parameter according to the synchronization message sent by the base station. Step 330 in which the terminal determines the first parameter may be performed before step 320, or may be performed after step 320. Alternatively, step 330 and step 320 may be simultaneously performed.

Step 340: The terminal receives the scrambled first message on the first channel.

It should be understood that, in an example in which the first channel is a physical downlink shared channel, when the base station sends the scrambled system message on the physical downlink shared channel, the terminal receives the scrambled system message on the physical downlink shared channel.

Step 350: The terminal generates a scrambling code according to the first parameter.

A manner in which the terminal generates the scrambling code according to the first parameter is similar to a manner in which the base station generates the scrambling code according to the first parameter. In this embodiment of this application, the manner in which the base station generates the scrambling code according to the first parameter is described in detail. For the manner in which the terminal generates the scrambling code according to the first parameter, refer to the manner in which the base station generates the scrambling code according to the first parameter in this embodiment of this application.

It should be noted that there is no definite sequence for step 340 and step 330 and for step 340 and step 350; and step 330 is performed before step 350.

Step 360: The terminal descrambles the received scrambled first message according to the scrambling code.

In this embodiment of this application, a value of the first modulus may be 2^(n), where n is a positive integer greater than 1. For example, the value of the first modulus may be 4, 8, 16, 32, 64, 128, 256, or 512. Alternatively, the value of the first modulus may be a prime number greater than or equal to 3, such as 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, or 61.

Further, in addition to either of the radio frame number or the value resulting from the radio frame number modulo the first modulus, the first parameter may include at least one of an RNTI (radio network temporary identifier), a timeslot number, a symbol number, a cell identity, or a carrier identifier.

When the first message is a system message, the RNTI may be an SI-RNTI.

For example, the first parameter includes the radio frame number. Because the scrambling code is generated according to the radio frame number, the scrambling code generated according to the first parameter also varies with time, so that an anti-interference capability in sending of the first message is enhanced. In this embodiment of this application, because the first modulus is a positive integer greater than or equal to 3, at least three different values are obtained from different radio frame numbers modulo the first modulus. Therefore, at least three scrambling codes generated according to the first parameter are different, thereby ensuring that the radio frame number can make the generation of the scrambling code initialization seed more randomized.

When the first parameter includes the value resulting from the radio frame number modulo the first modulus, a quantity of bits of the obtained scrambling code is more easily not greater than a preset maximum quantity of bits. When the first modulus is a prime number greater than or equal to 3, a better anti-interference capability in sending of the first message can be achieved by using a feature of the prime number.

For example, a prime number 5 can be divided exactly only by 5 and 1. Therefore, when the first modulus is a prime number, a quantity of different values resulting from different radio frame numbers modulo the first modulus is greater than that obtained when the first modulus is a non-prime number. Therefore, when the first modulus is a prime number, a better anti-interference capability in sending of the first message can be achieved.

In step 300, the base station generates the scrambling code according to the first parameter. Specifically, the scrambling code may be directly generated according to the first parameter. It is assumed that the first parameter includes only the radio frame number, and the scrambling code may be the radio frame number represented by using a binary system. It is assumed that the first parameter includes only the value resulting from the radio frame number modulo the first modulus, and the scrambling code may be a value resulting from the radio frame number represented by using a binary system modulo the first modulus.

In addition, a base station may generate a scrambling code according to a first parameter in two different implementations. One possible implementation is: The base station generates a scrambling code initialization seed according to the first parameter, and then generates the scrambling code according to the scrambling code initialization seed. The first parameter includes only the radio frame number, or the first parameter includes only the value resulting from the radio frame number modulo the first modulus. The other possible implementation includes a same step of generating the scrambling code as the foregoing possible implementation. The base station generates a scrambling code initialization seed according to the first parameter, and then generates the scrambling code according to the scrambling code initialization seed. However, in addition to either of the radio frame number or the value resulting from the radio frame number modulo the first modulus, the first parameter includes at least one of the RNTI, the timeslot number, the symbol number, the cell identity, or the carrier identifier.

Specifically, in Example 1, the first parameter includes only the radio frame number n_(f), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f); or the first parameter includes only the value resulting from the radio frame number n_(f) modulo the first modulus k, and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f) mod k. It should be noted that, c_(init)=n_(f) is used as an example, and linear deformation may also be performed on c_(init)=n_(f). An example in which n_(f) is represented by using a binary system is used. In this case, when a condition that a sequence length of the scrambling code initialization seed is not greater than a preset threshold is met, c_(init)=n_(f) may be deformed into c_(init)=n_(f)+N, where N is a preset constant binary sequence; or c_(init)=n_(f) may be deformed into c_(init)=2^(n)·n_(f)+N, where n is a quantity of bits occupied by the constant binary sequence N in c_(init). Alternatively, deformation similar to that performed on c_(init)=n_(f) may be performed when c_(init)=n_(f) mod k. Details are not described herein again.

c_(init)=2^(n)·n_(f)+N is used as an example. It is assumed that a length of c_(init) is 16, n_(f)=1011 0111, N=1100 0101, and n=8. In this case, in c_(init), n_(f) is higher eight bits, and N is lower eight bits. c_(init)=1011 0111 1100 0101.

Example 2: The first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the radio network temporary identifier n_(RNTI), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ¹ +(n_(f) mod k)·2^(b) ¹ +└n_(s)/2┘·2^(c) ¹ +N_(ID) ^(cell), where a₁ is a sum of quantities of bits occupied by (n_(f) mod k), └n_(s)/2┘, and N_(ID) ^(cell) in c_(init), b₁ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init).

For example, it is assumed that c_(init) is a binary sequence that is not greater than 16 bits, n_(RNTI)=1011, (n_(f) mod k)=0001, └n_(s)/2┘=0101, and N_(ID) ^(cell)=1010. In this case, a₁=12, b₁=8, and c₁=4. Because c_(init)=n_(RNTI)·2^(a) ¹ +(n_(f) mod k)·2^(b) ¹ +└n_(s)/2┘·2^(c) ¹ +N_(ID) ^(cell), c_(init)=1011 0001 0101 1010. That is, n_(RNTI) occupies highest four bits in c_(init), (n_(f) mod k) occupies higher four bits in c_(init), └n_(s)/2┘ occupies lower four bits in c_(init), and N_(ID) ^(cell) occupies lowest four bits.

It should be noted that, in this embodiment, specific bits respectively occupied by n_(RNTI), (n_(f) mod k), └n_(s)/2┘ and N_(ID) ^(cell) in c_(init) may be interchanged. This is not limited in this application. For example, c_(init)=n_(RNTI)+(n_(f) mod k)·2^(c) ¹ +└n_(s)/2┘·2^(b) ¹ +N_(ID) ^(cell)·2^(a) ¹ . In this case, if c_(init) is a binary sequence that is not greater than 16 bits, a₁=12, b₁=8, and c₁=4, n_(RNTI) occupies lowest four bits in c_(init), (n_(f) mod k) occupies lower four bits in c_(init), └n_(s)/2┘ occupies higher four bits in c_(init), and N_(ID) ^(cell) occupies highest four bits.

Example 3: The first parameter includes the radio frame number n_(f), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ² +└n_(s)/2┘·2^(c) ² +N_(ID) ^(cell), where b₂ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init).

Example 4: The first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ³ +└n_(s)/2┘·2^(c) ³ +c_(init)=N_(ID) ^(cell), where b₃ is a sum of quantities of bits occupied by └n₂/2┘ and N_(ID) ^(cell) in c_(init), and c₃ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init).

Example 5: The first parameter includes the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ⁴ +(n_(f) mod k)·2^(b) ⁴ +N_(ID) ^(cell), where a₄ is a sum of quantities of bits occupied by (n_(f) mod k) and N_(ID) ^(cell) in c_(init), and b₄ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init).

Example 6: The first parameter includes the cell identity N_(ID) ^(cell) and the value resulting from the radio frame number n_(f) modulo the first modulus k, and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ² +N_(ID) ^(cell), where b₅ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init).

Example 7: The first parameter includes the radio frame number n_(f) and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ⁶ +N_(ID) ^(cell), where b₆ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init).

Example 8: The first parameter includes at least one of the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), or the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=R·2^(a) ⁷ +[(n_(f)+h)mod k)+w]^(u)·P·2^(b) ⁷ +H·2^(c) ⁷ +Q, where R is a function of the radio network temporary identifier, for example, is equal to the radio network temporary identifier n_(RNTI), or is equal to 0 (meaning that there is no parameter R in the formula); h is an integer, for example, is equal to 0 or 1; k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; w is an integer, for example, is equal to 0 or 1; u is a non-negative integer, for example, 0, 1, 2, or 3; P is a function of the cell identity and/or the radio frame number, for example, is equal to the cell identity N_(ID) ^(cell), or is equal to N_(ID) ^(cell)·(n_(f) mod k)^(v), where v is a positive integer; H is a function of the timeslot number, for example, is equal to the timeslot number n_(s), or is equal to 0 (meaning that there is no parameter H in the formula); Q is a function of the cell identity, for example, is equal to the cell identity, or is equal to 0 (meaning that there is no parameter Q in the formula); a₇ is a non-negative integer, for example, is equal to a sum of quantities of bits occupied by [(n_(f)+h)mod k)+w]^(u)·P, H, and Q in c_(init); b₇ is a non-negative integer, for example, is equal to a sum of quantities of bits occupied by H and Q in c_(init); and c₇ is a non-negative integer, for example, is equal to a quantity of bits occupied by Q in c_(init).

It should be noted that Example 3 to Example 8 are similar to Example 2. In this embodiment of this application, higher bits and lower bits in the bits occupied in c_(init) by variables included in the first parameter may be interchanged. Example 1 to Example 8 are merely examples for describing the technical solution of this embodiment of this application, and are not intended to limit the technical solution of this embodiment of this application.

It should be noted that the first parameter may further include at least one of the symbol number, the hyper frame number, or the carrier identifier. In this embodiment of this application, the RNTI, the timeslot number, the symbol number, the hyper frame number, the cell identity, the carrier identifier, and the like may all participate in the generation of the scrambling code initialization seed by using values resulting from them modulo the modulus. Specifically, the modulus may be a prime number or a power of 2. For example, the first parameter includes the radio frame number n_(f) and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ⁶ +N_(ID) ^(cell) mod k, where b₆ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init).

In a possible implementation of this embodiment of this application, the base station sends, to the terminal, indication information used to indicate a manner of scrambling the first channel/first information.

Specifically, that the base station sends, to the terminal, indication information used to indicate a manner of scrambling the first channel/first information includes: The indication information may be used to indicate a manner of determining a scrambling code initialization seed of the first channel/first information and/or a scrambling code initialization method.

Specifically, the scrambling code initialization method includes at least one of a scrambling code length or a scrambling code initialization frequency/period.

The indication information may be located in a system message (a MIB or a SIB), and be sent by the base station to the terminal by using a PBCH or a PDSCH.

For example, the first message is a system message such as a SIB 1, and the first channel is a PDSCH. The indication information may be located in a system message MIB and be transmitted in a PBCH.

For example, the indication information may include two binary values 0 and 1, and different values of the indication information may be corresponding to different manners of scrambling the first channel/first information. For example, 0 indicates a method 1 for determining a scrambling code initialization seed, and 1 indicates a method 2 for determining a scrambling code initialization seed.

For example, the indication information may include four binary values 00, 01, 10, and 11 that may be respectively corresponding to M manners of scrambling the first channel/first information, for example, respectively corresponding to M methods for determining a scrambling code initialization seed of the first channel/first information. A value range of M is {1, 2, 3, 4}. When M<4, at least one of four states 00, 01, 10, or 11 may be selectively used.

In the foregoing example, the indication information may include another quantity of values, and details are not described herein.

According to a same inventive concept, the embodiments of the present invention further provide a base station shown in FIG. 4 a , a terminal shown in FIG. 5 a , and a communications system shown in FIG. 6 . A method corresponding to the base station shown in FIG. 4 a , the terminal shown in FIG. 5 a , and the communications system shown in FIG. 6 is the message transmission method shown in FIG. 1 in the embodiment of this application. Therefore, in the embodiments of this application, for implementations of the base station shown in FIG. 4 a , the terminal shown in FIG. 5 a , and the communications system shown in FIG. 6 , refer to the implementation of the method shown in FIG. 1 . No repeated description is provided.

As shown in FIG. 4 a , a base station 400 a in an embodiment of this application includes a processing module 410 a and a sending module 420 a. The processing module 410 a is configured to: generate a scrambling code according to a first time parameter, and scramble a system message according to the scrambling code. The sending module 420 a is configured to send, to a terminal on a physical broadcast channel, the system message scrambled by the processing module 410 a.

In a possible implementation, the first time parameter is a function of at least one of a radio frame number, a timeslot number, a hyper frame number, or a symbol number.

In a possible implementation, the first time parameter is any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number.

Alternatively, the first time parameter is a value resulting from any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number modulo a first modulus, where the first modulus is a positive integer.

In a possible implementation, the first modulus is 2^(n), where n is a positive integer that is not equal to 3; or the first modulus is 8; or the first modulus is a prime number.

A possible implementation in which the processing module 410 a generates the scrambling code according to the first time parameter is: generating a scrambling code initialization seed according to the first time parameter and a first variable group, and generating the scrambling code according to the scrambling code initialization seed, where the first variable group includes at least one of a cell identity, a radio network temporary identifier RNTI, or a carrier identifier.

Another possible implementation in which the processing module 410 a generates the scrambling code according to the first time parameter is: generating a scrambling code initialization seed according to the first time parameter, and generating the scrambling code according to the scrambling code initialization seed.

This embodiment of this application further provides several possible implementations in which the base station generates the scrambling code initialization seed according to the first time parameter.

The first time parameter is the radio frame number n_(f), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f) mod k, where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; or the first time parameter is the radio frame number n_(f), the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f)·2^(a) ¹ )+N_(ID) ^(cell), or c_(init)=(N_(ID) ^(cell)·2^(b) ¹ )+n_(f), where a₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init), and b₁ is a quantity of bits occupied by n_(f) in c_(init); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(a) ² +N_(ID) ^(cell), or c_(init)=(n_(f) mod k)·2^(a) ² +N_(ID) ^(cell), where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; a₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); and b₂ is a quantity of bits occupied by (n_(f) mod k) in c_(init).

It should be noted that, in this embodiment of this application, the processing module 410 a may be implemented by a processor, and the sending module 420 a may be implemented by a transceiver. As shown in FIG. 4 b , a base station 400 b may include a processor 410 b, a transceiver 420 b, and a memory 430 b. The memory 430 b may be configured to store a program/code pre-installed when the base station 400 b is delivered from a factory, or may store code executed by the processor 410 b, or the like.

The processor 410 b may be a general-purpose CPU (central processing unit), a microprocessor, an ASIC (application-specific integrated circuit), or one or more integrated circuits, and is configured to perform a related operation, so as to implement the technical solution provided in this embodiment of this application.

It should be noted that although only the processor 410 b, the transceiver 420 b, and the memory 430 b are shown in the base station 400 b shown in FIG. 4 b , in a specific implementation process, persons skilled in the art should understand that the base station 400 b further includes another device required for implementing normal running. In addition, persons skilled in the art should understand that, according to a specific requirement, the base station 400 b may further include a hardware device that implements another additional function. In addition, persons skilled in the art should understand that the base station 400 b may include only devices or modules required for implementing this embodiment of this application, but not necessarily include all the devices shown in FIG. 4 b.

Persons of ordinary skill in the art may understand that all or some of the processes of the methods in the embodiments may be implemented by a computer program instructing relevant hardware. The program may be stored in a computer readable storage medium. When the program is executed, the processes of the methods in the embodiments may be included. The foregoing storage medium may be a magnetic disk, an optical disc, a ROM (read-only memory), a RAM (random access memory), or the like.

As shown in FIG. 5 a , a terminal 500 a in an embodiment of this application includes a processing module 510 a and a receiving module 520 a. The processing module 510 a is configured to determine a first time parameter. The receiving module 520 a is configured to receive a scrambled system message on a physical broadcast channel. The processing module 510 a is further configured to: generate a scrambling code according to the first time parameter; and descramble, according to the scrambling code, the scrambled system message received by the receiving module 520 a.

In a possible implementation, the first time parameter is a function of at least one of a radio frame number, a timeslot number, a hyper frame number, or a symbol number.

In a possible implementation, the first time parameter is any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number.

Alternatively, the first time parameter is a value resulting from any one of a radio frame number, a timeslot number, a hyper frame number, and a symbol number modulo a first modulus, where the first modulus is a positive integer.

In a possible implementation, the first modulus is 2^(n), where n is a positive integer that is not equal to 3; or the first modulus is 8; or the first modulus is a prime number.

A possible implementation in which the processing module 510 a generates the scrambling code according to the first time parameter is: generating a scrambling code initialization seed according to the first time parameter and a first variable group, and generating the scrambling code according to the scrambling code initialization seed, where the first variable group includes at least one of a cell identity, a radio network temporary identifier RNTI, or a carrier identifier.

Another possible implementation in which the processing module 510 a generates the scrambling code according to the first time parameter is: generating a scrambling code initialization seed according to the first time parameter, and generating the scrambling code according to the scrambling code initialization seed.

This embodiment of this application further provides several possible implementations in which the terminal generates the scrambling code initialization seed according to the first time parameter.

The first time parameter is the radio frame number n_(f), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=n_(f) mod k, where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; or the first time parameter is the radio frame number n_(f), the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f)·2^(a) ¹ )+N_(ID) ^(cell), or c_(init)=(N_(ID) ^(cell)·2^(b) ¹ )+n_(f), where a₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init), and b₁ is a quantity of bits occupied by n_(f) in c_(init); or the first time parameter is a value resulting from the radio frame number n_(f) modulo the first modulus k, the first variable group includes the cell identity N_(ID) ^(cell), and the initialization scrambling code seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(a) ² +N_(ID) ^(cell), or c_(init)=N_(ID) ^(cell)·2^(b) ² +(n_(f) mod k), where k=8, k is a prime number, or k is a positive integer that is not 8 or a prime number; a₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); and b₂ is a quantity of bits occupied by (n_(f) mod k) in c_(init).

It should be noted that, in this embodiment of this application, the processing module 510 a may be implemented by a processor, and the receiving module 520 a may be implemented by a transceiver. As shown in FIG. 5 b , a terminal 500 b may include a processor 510 b, a transceiver 520 b, and a memory 530 b. The memory 530 b may be configured to store a program/code pre-installed when the terminal 500 b is delivered from a factory, or may store code executed by the processor 510 b, or the like.

The processor 510 b may be a general-purpose CPU, a microprocessor, an ASIC, or one or more integrated circuits, and is configured to perform a related operation, so as to implement the technical solution provided in this embodiment of this application.

It should be noted that although only the processor 510 b, the transceiver 520 b, and the memory 530 b are shown in the terminal 500 b shown in FIG. 5 b , in a specific implementation process, persons skilled in the art should understand that the terminal 500 b further includes another device required for implementing normal running. In addition, persons skilled in the art should understand that, according to a specific requirement, the terminal 500 b may further include a hardware device that implements another additional function. In addition, persons skilled in the art should understand that the terminal 500 b may include only devices or modules required for implementing this embodiment of this application, but not necessarily include all the devices shown in FIG. 5 b.

Persons of ordinary skill in the art may understand that all or some of the processes of the methods in the embodiments may be implemented by a computer program instructing relevant hardware. The program may be stored in a computer readable storage medium. When the program is executed, the processes of the methods in the embodiments may be included. The foregoing storage medium may be a magnetic disk, an optical disk, a ROM, a RAM, or the like.

As shown in FIG. 6 , a communications system 600 in an embodiment of this application includes the base station 400 a shown in FIG. 4 a and the terminal 500 a shown in FIG. 5 a.

According to a same inventive concept, the embodiments of the present invention further provide a base station shown in FIG. 7 a , a terminal shown in FIG. 8 a , and a communications system shown in FIG. 9 . A method corresponding to the base station shown in FIG. 7 a , the terminal shown in FIG. 8 a , and the communications system shown in FIG. 9 is the message transmission method shown in FIG. 3 in the embodiment of this application. Therefore, in the embodiments of this application, for implementations of the base station shown in FIG. 7 a , the terminal shown in FIG. 8 a , and the communications system shown in FIG. 9 , refer to the implementation of the method shown in FIG. 3 . No repeated description is provided.

As shown in FIG. 7 a , a base station 700 a in an embodiment of this application includes a processing module 710 a and a sending module 720 a. The processing module 710 a is configured to: generate a scrambling code according to a first parameter, and scramble a first message according to the scrambling code. The first parameter includes a radio frame number or a value resulting from the radio frame number modulo a first modulus, and the first modulus is a positive integer greater than or equal to 3. The sending module 720 a is configured to send the scrambled first message to a terminal on a first channel.

In a possible implementation, the first message is a system message, or the first message is a part of a system message; or the first message is an encoded system message, or the first message is a part of an encoded system message. The first channel is a physical downlink shared channel or a physical broadcast channel.

In a possible implementation, in addition to the radio frame number or the value resulting from the radio frame number modulo the first modulus, the first parameter includes at least one of a radio network temporary identifier RNTI, a timeslot number, a symbol number, a cell identity, or a carrier identifier.

In a possible implementation, the first modulus is 2^(n), where n is a positive integer greater than 1; or the first modulus is a prime number greater than or equal to 3.

A possible implementation in which the processing module 710 a generates the scrambling code according to the first parameter is: generating a scrambling code initialization seed according to the first parameter, and generating the scrambling code according to the scrambling code initialization seed.

This embodiment of this application further provides several possible implementations in which the base station generates the scrambling code initialization seed according to the first parameter.

The first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the radio network temporary identifier n_(RNTI), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ¹ +(n_(f) mod k)·2^(b) ¹ +└n_(s)/2┘·2^(c) ¹ +N_(ID) ^(cell), where a₁ is a sum of quantities of bits occupied by (n_(f) mod k), └n_(s)/2┘, and N_(ID) ^(cell) in c_(init), b₁ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ² +└n_(s)/2┘·2^(c) ² +N_(ID) ^(cell), where b₂ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ³ +└n_(s)/2┘·2^(c) ³ +N_(ID) ^(cell), where b₃ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₃ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ⁴ +(n_(f) mod k)·2^(b) ⁴ +N_(ID) ^(cell), where a₄ is a sum of quantities of bits occupied by (n_(f) mod k) and N_(ID) ^(cell) in c_(init), and b₄ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the cell identity N_(ID) ^(cell) and the value resulting from the radio frame number n_(f) modulo the first modulus k, and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ³ +N_(ID) ^(cell), where b₅ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f) and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ⁶ +N_(ID) ^(cell), where b₆ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init).

It should be noted that, in this embodiment of this application, the processing module 710 a may be implemented by a processor, and the sending module 720 a may be implemented by a transceiver. As shown in FIG. 7 b , a base station 700 b may include a processor 710 b, a transceiver 720 b, and a memory 730 b. The memory 730 b may be configured to store a program/code pre-installed when the base station 700 b is delivered from a factory, or may store code executed by the processor 710 b, or the like.

The processor 710 b may be a general-purpose CPU, a microprocessor, an ASIC, or one or more integrated circuits, and is configured to perform a related operation, so as to implement the technical solution provided in this embodiment of this application.

It should be noted that although only the processor 710 b, the transceiver 720 b, and the memory 730 b are shown in the base station 700 b shown in FIG. 7 b , in a specific implementation process, persons skilled in the art should understand that the base station 700 b further includes another device required for implementing normal running. In addition, persons skilled in the art should understand that, according to a specific requirement, the base station 700 b may further include a hardware device that implements another additional function. In addition, persons skilled in the art should understand that the base station 700 b may include only devices or modules required for implementing this embodiment of this application, but not necessarily include all the devices shown in FIG. 7 b.

Persons of ordinary skill in the art may understand that all or some of the processes of the methods in the embodiments may be implemented by a computer program instructing relevant hardware. The program may be stored in a computer readable storage medium. When the program is executed, the processes of the methods in the embodiments may be included. The foregoing storage medium may be a magnetic disk, an optical disk, a ROM, a RAM, or the like.

As shown in FIG. 8 a , a terminal 800 a in an embodiment of this application includes a processing module 810 a and a receiving module 820 a. The processing module 810 a is configured to determine a first parameter. The first parameter includes a radio frame number or a value resulting from the radio frame number modulo a first modulus, and the first modulus is a positive integer greater than or equal to 3. The receiving module 820 a is configured to receive a scrambled first message on a first channel. The processing module 810 a is further configured to: generate a scrambling code according to the first parameter; and descramble, according to the scrambling code, the scrambled first message received by the receiving module 820 a.

In a possible implementation, the first message is a system message, or the first message is a part of a system message; or the first message is an encoded system message, or the first message is a part of an encoded system message. The first channel is a physical downlink shared channel or a physical broadcast channel.

In a possible implementation, in addition to the radio frame number or the value resulting from the radio frame number modulo the first modulus, the first parameter includes at least one of a radio network temporary identifier RNTI, a timeslot number, a symbol number, a cell identity, or a carrier identifier.

In a possible implementation, the first modulus is 2^(n), where n is a positive integer greater than 1; or the first modulus is a prime number greater than or equal to 3.

A possible implementation in which the processing module 810 a generates the scrambling code according to the first parameter is: generating a scrambling code initialization seed according to the first parameter, and generating the scrambling code according to the scrambling code initialization seed.

This embodiment of this application further provides several possible implementations in which the processing module 810 a generates the scrambling code initialization seed according to the first time parameter.

The first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the radio network temporary identifier n_(RNTI), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ¹ +(n_(f) mod k)·2^(b) ¹ +└n_(s)/2┘·2^(c) ¹ +N_(ID) ^(cell), where a₁ is a sum of quantities of bits occupied by (n_(f) mod k), └n_(s)/2┘, and N_(ID) ^(cell) in c_(init), b₁ is a sum of quantities of bits occupied by └n₂/2┘ and N_(ID) ^(cell) in c_(init), and c₁ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f), the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ² +└n_(s)/2┘·2^(c) ² +N_(ID) ^(cell), where b₂ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₂ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the value resulting from the radio frame number n_(f) modulo the first modulus k, the timeslot number n_(s), and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ³ +└n_(s)/2┘·2^(c) ³ +N_(ID) ^(cell), where b₃ is a sum of quantities of bits occupied by └n_(s)/2┘ and N_(ID) ^(cell) in c_(init), and c₃ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio network temporary identifier n_(RNTI), the value resulting from the radio frame number n_(f) modulo the first modulus k, and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(RNTI)·2^(a) ⁴ +(n_(f) mod k)·2^(b) ⁴ +N_(ID) ^(cell), where b₄ is a sum of quantities of bits occupied by (n_(f) mod k) and N_(ID) ^(cell) in c_(init), and b₄ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the cell identity N_(ID) ^(cell) and the value resulting from the radio frame number n_(f) modulo the first modulus k, and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=(n_(f) mod k)·2^(b) ⁵ +N_(ID) ^(cell), where b₅ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init); or the first parameter includes the radio frame number n_(f) and the cell identity N_(ID) ^(cell), and the scrambling code initialization seed c_(init) meets the following expression: c_(init)=n_(f)·2^(b) ⁶ +N_(ID) ^(cell), where b₆ is a quantity of bits occupied by N_(ID) ^(cell) in c_(init).

It should be noted that, in this embodiment of this application, the processing module 810 a may be implemented by a processor, and the receiving module 820 a may be implemented by a transceiver. As shown in FIG. 8 b , a terminal 800 b may include a processor 810 b, a transceiver 820 b, and a memory 830 b. The memory 830 b may be configured to store a program/code pre-installed when the terminal 800 b is delivered from a factory, or may store code executed by the processor 810 b, or the like.

The processor 810 b may be a general-purpose CPU, a microprocessor, an ASIC, or one or more integrated circuits, and is configured to perform a related operation, so as to implement the technical solution provided in this embodiment of this application.

It should be noted that although only the processor 810 b, the transceiver 820 b, and the memory 830 b are shown in the terminal 800 b shown in FIG. 8 b , in a specific implementation process, persons skilled in the art should understand that the terminal 800 b further includes another device required for implementing normal running. In addition, persons skilled in the art should understand that, according to a specific requirement, the terminal 800 b may further include a hardware device that implements another additional function. In addition, persons skilled in the art should understand that the terminal 800 b may include only devices or modules required for implementing this embodiment of this application, but not necessarily include all the devices shown in FIG. 8 b.

Persons of ordinary skill in the art may understand that all or some of the processes of the methods in the embodiments may be implemented by a computer program instructing relevant hardware. The program may be stored in a computer readable storage medium. When the program is executed, the processes of the methods in the embodiments may be included. The foregoing storage medium may be a magnetic disk, an optical disk, a ROM, a RAM, or the like.

As shown in FIG. 9 , a communications system 900 in an embodiment of this application includes the base station 700 a shown in FIG. 7 a and the terminal 800 a shown in FIG. 8 a.

In conclusion, in the embodiments of this application, a base station generates a scrambling code according to a first time parameter, then scrambles a system message according to the scrambling code, and finally sends the scrambled system message to a terminal on a physical broadcast channel. In this technical solution, because the first time parameter has different values at at least two different moments, scrambling codes determined at the at least two corresponding different moments are different. Therefore, a possibility at which the base station uses a same scrambling code to scramble a same system message repeatedly in a time period is reduced, so that an anti-interference capability in system message transmission is improved.

Persons skilled in the art should understand that the embodiments of this application may be provided as a method, a system, or a computer program product. Therefore, the embodiments of this application may use a form of hardware only embodiments, software only embodiments, or embodiments with a combination of software and hardware. In addition, the embodiments of this application may use a form of a computer program product that is implemented on one or more computer usable storage media (including but not limited to a magnetic disk memory, a CD-ROM, an optical memory, and the like) that include computer usable program code.

The embodiments of this application have been described with reference to the flowcharts and/or block diagrams of the method, the device (system), and the computer program product according to the embodiments of this application. It should be understood that computer program instructions may be used to implement each process and/or each block in the flowcharts and/or the block diagrams, and a combination of a process and/or a block in the flowcharts and/or the block diagrams. These computer program instructions may be provided for a general-purpose computer, a dedicated computer, an embedded processor, or a processor of any other programmable data processing device to generate a machine, so that the instructions executed by a computer or a processor of any other programmable data processing device generate an apparatus for implementing a specified function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.

These computer program instructions may be stored in a computer readable memory that can instruct the computer or any other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory generate an artifact that includes an instruction apparatus. The instruction apparatus implements a specified function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.

These computer program instructions may also be loaded onto a computer or another programmable data processing device, so that a series of operations and steps are performed on the computer or the another programmable device, thereby generating computer-implemented processing. Therefore, the instructions executed on the computer or the another programmable device provide steps for implementing a specified function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.

Persons skilled in the art can make various modifications and variations to the embodiments of this application without departing from the spirit and scope of this application. This application is intended to cover these modifications and variations provided that they fall within the scope of protection defined by the following claims and their equivalent technologies. 

What is claimed is:
 1. A message sending method, comprising: generating a scrambling code according to a scrambling code initialization seed, wherein the scrambling code initialization seed meets the following expression: c _(init) =R·2^(a) ⁷ +P·(^(n) ^(f) mod ^(k)+1)·2^(b) ⁷ where c_(init) is the scrambling code initialization seed, R is a function of n_(RNTI), a₇ is a non-negative integer, P is a function of a cell identity, n_(f) is the a frame number of a message, k is a prime number, and b₇ is a non-negative integer; scrambling the message according to the scrambling code to render a scrambled message; and sending the scrambled message to a terminal on a physical downlink shared channel, wherein the message is a system message, a part of a system message, an encoded system message, or a part of an encoded system message, and wherein the system message is a system information block.
 2. The method according to claim 1, wherein R is equal to the n_(RNTI), P is equal to N_(ID) ^(cell)+1, where N_(ID) ^(cell) is the cell identity, and k is equal to
 61. 3. The method according to claim 1, wherein a₇ is equal to a number of bits occupied by (^(n) ^(f) mod ^(k)+1)·P, where P is equal to N_(ID) ^(cell)+1, N_(ID) ^(cell) is the cell identity, and k is equal to
 61. 4. The method according to claim 1, wherein the frame number n_(f) is a number of a radio frame in which a start position for sending the message is located.
 5. The method according to claim 1, wherein b₇ is equal to
 0. 6. A message receiving method, the method comprising: generating a scrambling code according to a scrambling code initialization seed, wherein the scrambling code initialization seed meets the following expression: c _(init) =R·2^(a) ⁷ +P·(^(n) ^(f) mod ^(k)+1)·2^(b) ⁷ where c_(init) is the scrambling code initialization seed, R is a function of n_(RNTI), a₇ is a non-negative integer, P is a function of a cell identity, n_(f) is the a frame number of a message, k is a prime number, and b₇ is a non-negative integer; receiving a scrambled message on a physical downlink shared channel; and descrambling the scrambled message according to the scrambling code for acquiring the message, wherein the message is a system message, a part of a system message, an encoded system message, or a part of an encoded system message, and wherein the system message is a system information block.
 7. The method according to claim 6, wherein R is equal to the n_(RNTI), P is equal to N_(ID) ^(cell)+1, where N_(ID) ^(cell) is the cell identity, and k is equal to
 61. 8. The method according to claim 6, wherein a₇ is equal to a number of bits occupied by (^(n) ^(f) mod ^(k)+1)·P, where P is equal to N_(ID) ^(cell)+1, N_(ID) ^(cell) is the cell identity, and k is equal to
 61. 9. The method according to claim 6, wherein the frame number n^(f) is a number of a radio frame in which a start position for sending the message is located.
 10. The method according to claim 6, wherein b₇ is equal to
 0. 11. A network side device, comprising: at least one processor, and a non-transitory computer-readable medium storing computer-executable instructions that, when executed by the at least one processor, facilitate the network side device carrying out a method comprising: generating a scrambling code according to a scrambling code initialization seed, wherein the scrambling code initialization seed meets the following expression: c _(init) =R·2^(a) ⁷ +P·(^(n) ^(f) mod ^(k)+1)·2^(b) ⁷ where c_(init) is the scrambling code initialization seed, R is a function of n_(RNTI), a₇ is a non-negative integer, P is a function of a cell identity, n_(f) is the a frame number of a message, k is a prime number, and b₇ is a non-negative integer; scrambling the message according to the scrambling code to render a scrambled message; and sending the scrambled message to a terminal on a physical downlink shared channel, wherein the message is a system message, a part of a system message, an encoded system message, or a part of an encoded system message, and wherein the system message is a system information block.
 12. The device according to claim 11, where R is equal to the n_(RNTI), P is equal to N_(ID) ^(cell)+1, where N_(ID) ^(cell) is the cell identity, and k is equal to
 61. 13. The device according to claim 11, wherein a₇ is equal to a number of bits occupied by (^(n) ^(f) mod ^(k)+1)·P, where P is equal to N_(ID) ^(cell)+1, N_(ID) ^(cell) is the cell identity, and k is equal to
 61. 14. The device according to claim 11, wherein the frame number n_(f) is a number of a radio frame in which a start position for sending the message is located.
 15. The device according to claim 11, wherein b₇ is equal to
 0. 16. A communication device, comprising: at least one processor, and a non-transitory computer-readable medium storing computer-executable instructions that, when executed by the at least one processor, facilitate the communication device carrying out a method comprising: generating a scrambling code according to a scrambling code initialization seed, wherein the scrambling code initialization seed meets the following expression: c _(init) =R·2^(a) ⁷ +P·(^(n) ^(f) mod ^(k)+1)·2^(b) ⁷ where c_(init) is the scrambling code initialization seed, R is a function of n_(RNTI), a₇ is a non-negative integer, P is a function of a cell identity, n_(f) is the a frame number of a message, k is a prime number, and b₇ is a non-negative integer; receiving a scrambled message on a physical downlink shared channel; and descrambling the scrambled message according to the scrambling code for acquiring the message, wherein the message is a system message, a part of a system message, an encoded system message, or a part of an encoded system message, and wherein the system message is a system information block.
 17. The device according to claim 16, where R is equal to n_(RNTI), P is equal to N_(ID) ^(cell)+1, where N_(ID) ^(cell) is the cell identity, and k is equal to
 61. 18. The device according to claim 16, wherein a₇ is equal to a number of bits occupied by (^(n) ^(f) mod ^(k)+1)·P, where P is equal to N_(ID) ^(cell)+1, N_(ID) ^(cell) is the cell identity, and k is equal to
 61. 19. The device according to claim 16, wherein the frame number n_(f) is a number of a radio frame in which a start position for sending the message is located.
 20. The device according to claim 16, wherein b₇ is equal to
 0. 